Assignment Commands with Array References

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Alfred V. Aho , John E. Hopcroft, The Design and Analysis of Computer Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1974
	2	AHO, A V, AND ULLMAN, J D Optimization of straight hne programs SIAM J Compuong 1, 1 (March 1972), 1-19
	3	AHO, A V, AND ULI.MAN, J D Equwalence of programs with structured variables JCSS 6, 2 (Aprd 1972), 125-137
	4	Robert S. Boyer , Bernard Elspas , Karl N. Levitt, SELECT—a formal system for testing and debugging programs by symbolic execution, Proceedings of the international conference on Reliable software, p.234-245, April 21-23, 1975, Los Angeles, California
	5	BURSTALL, R M Semantics of assignment Machine lntelhgence 2, American Elsevier, New York, N Y , 1968, pp 3-20
	6	John Cocke, Programming languages and their compilers: Preliminary notes, Courant Institute of Mathematical Sciences, New York University, 1969
	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 equwalence 8th Annual Princeton Conference on Information Sciences and Systems, March 1974, pp 15-20
	9	CUUK, K Combinatorial problems m the theory of complexity of algorithmic nets without cycles for simple computers Aphkace Matemaoky 16 (1971), 188-202
	10	DE BAKKER, J W Correctness proofs for assignment statements Mathematlsch Centrum Report IW 55/76, March 1976
	11	Peter Downey , Hanan Samet , Ravi Sethi, Off-line and on-line algorithms for deducing equalities, Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.158-170, January 23-25, 1978, Tucson, Arizona [doi>10.1145/512760.512777]
	12	HOARE, C A R, AND WIRTH, N An axiomatic defimtlon of the programming language Pascal :4cta lnformaoca 2 (1973), 335-355
	13	Christoph M. Hoffmann , Lawrence H. Landweber, A Completeness Theorem for Straight-Line Programs with Structured Variables, Journal of the ACM (JACM), v.23 n.1, p.203-220, Jan. 1976 [doi>10.1145/321921.321940]
	14	IGARASHI, S, LONDON, R L, AND LUCKHAM, D C Automatic program verification 1 A logical basis and ~ts implementation Acta lnformaoca 4, 2 (1975), 145-182
	15	JOHNSON, D B On the power of arrays m umversal languages Seventh Annual Princeton Conference on Information Sciences and Systems, March 1973, pp 292-296
	16	Donald M. Kaplan, Some Completeness Results in the Mathematical Theory of Computation, Journal of the ACM (JACM), v.15 n.1, p.124-134, Jan. 1968 [doi>10.1145/321439.321447]
	17	James C. King, Symbolic execution and program testing, Communications of the ACM, v.19 n.7, p.385-394, July 1976 [doi>10.1145/360248.360252]
	18	LADNER, R.E., LYNCH, N.A., AND SELMAN, A.L. A comparison of polynomial t~me reducibilities. Theorencal Computer Sclence I (1975), 103-123
	19	David C. Luckham , Norihisa Suzuki, Automatic program verification V: verification-oriented proof rules for arrays, records and pointers, Stanford University, Stanford, CA, 1976
	20	Zohar Manna, Introduction to Mathematical Theory of Computation, McGraw-Hill, Inc., New York, NY, 1974
	21	Me 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 umon and find 18th Annual Symposium on Foundations of Computer Science, Oct 1977, pp. 114-119.
	23	Derek C. Oppen , Stephen A. Cook, Proving assertions about programs that manipulate data structures, Proceedings of seventh annual ACM symposium on Theory of computing, p.107-116, May 05-07, 1975, Albuquerque, New Mexico, United States [doi>10.1145/800116.803758]
	24	PARK, D. Some semantics of data structures Machme Intelhgence 3, American Elsewer, New York, N Y., 1968, pp 351-371
	25	Ravi Sethi, Conditional Expressions with Equality Tests, Journal of the ACM (JACM), v.25 n.4, p.667-674, Oct. 1978 [doi>10.1145/322092.322105]
	26	VAN LEEUWEN, J What makes some s~mple program optim~zatlon problems hard Tech Rep 206, Computer Science Dept, The Pennsylvania State Umverslty, University Park, Pa, Aug. 1976