Assignment Commands with Array References

Journal of the ACM (JACM)

Volumn 25, Issue 4, 1978, Pages 652-666

  Downey, Peter J ^a,b   Sethi, Ravi ^c  

^a UNIVERSITY OF ARIZONA   (United States)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

array asstgnments; data structures; NP complete; semanttcs

Indexed keywords

COMPUTER METATHEORY;

EID: 0018020102     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/322092.322104     Document Type: Article

References (26)

1. Aho, A V, Hopcroft, J E, and Ullman, J D The Design and Analysis of Computer Algorithms Addison-Wesley, Reading, Mass 1974.
2. Aho, A V, and Ullman, J D Optimization of straight line programs SIAM J Computing I, 1 (March 1972), 1-19.
3. Aho, A V, and Ullman, J D Equivalence of programs with structured variables JCSS 6, 2 (April 1972), 125-137.
4. Boyer, R S, Elspas, B, and Levitt, K N SELECT — A formal system for testing and debugging programs by symbolic execution International Conference on Reliable Software, April 1975, pp 234-245.
5. Burstall, R M Semantics of assignment Machine Intelligence 2, American Elsevier, New York, N Y, 1968, pp 3-20.
6. Cocke, J, and Schwartz, J T Programming Languages and Their Compilers, Preliminary Notes, Second Revised Version Courant Institute of Mathematical Sciences, New York, N Y, April 1970.
7. Constable, R L, and Gries, D On classes of program schemata SIAM J Computing 1, 1 (March 1972), 66-118.
8. Constable, R L, Hunt, H B III, and Sahni, S On the computational complexity of scheme equivalence 8th Annual Princeton Conference on Information Sciences and Systems, March 1974, pp 15-20.
9. Culik, K Combinatorial problems in the theory of complexity of algorithmic nets without cycles for simple computers Aplikace Matematiky 16 (1971), 188-202.
10. De Bakker, J W Correctness proofs for assignment statements Mathematisch Centrum Report IW 55/76, March 1976.
11. Downey, P J, Samet, H, and Sethi, R Off-line and on-line algorithms for deducing equalities Fifth Annual ACM Symposium on Principles of Programming Languages, Tucson, Arizona, Jan 1978, pp 158-170.
12. Hoare, C A R, and Wirth, N An axiomatic definition of the programming language Pascal Acta Informatica 2 (1973), 335-355.
13. Hoffmann, C M, and Landweber, L H A completeness theorem for straight-line programs with structured variables J ACM 23, 1 (Jan 1976), 203-220.
14. Igarashi, S, London, R L, and Luckham, D C Automatic program verification I A logical basis and its implementation Acta Informatica 4, 2 (1975), 145-182.
15. Johnson, D B On the power of arrays in universal languages Seventh Annual Princeton Conference on Information Sciences and Systems, March 1973, pp 292-296.
16. Kaplan, D M. Some completeness results in the mathematical theory of computation. J. ACM 15, 1 (Jan 1968), 124-134.
17. King, J.C. Symbolic execution and program testing. Comm. ACM 19, 7 (July 1976), 385-394.
18. Ladner, R.E., Lynch, N.A., and Selman, A.L.A. comparison of polynomial time reducibilities. Theoretical Computer Science 1 (1975), 103-123.
19. Luckham, D.C., and Suzuki, N. Automatic program verification V. Verification-oriented proof rules for arrays, records and pointers. Stanford AI Lab Memo AIM-278, March 1976.
20. Manna, Z. Mathematical Theory of Computation. McGraw-Hill, New York, N.Y., 1974.
21. Mc Carthy, J Towards a mathematical science of computation IFIP 62, 1962, pp 21-28.
22. Nelson, G., and Oppen, D C. Fast decision algorithms based on union and find 18th Annual Symposium on Foundations of Computer Science, Oct 1977, pp. 114-119.
23. Oppen, D.C., and Cook, S A Proving assertions about programs that manipulate data structures 7th Annual ACM Symposium on Theory of Computing, May 1975, pp. 107-116.
24. Park, D. Some semantics of data structures Machine Intelligence 3, American Elsevier, New York, NY., 1968, pp 351-371.
25. SETHI, R Conditional expressions with equality tests J. ACM 25, 4 (Oct. 1978), 667-674.
26. van Leeuwen, J What makes some simple program optimization problems hard Tech Rep 206, Computer Science Dept, The Pennsylvania State University, University Park, Pa, Aug. 1976.