Assignment Commands with Array References

Stratght line programs with assignment statements involving both simple and array variables are considered Two such programs are equivalent if they compute the same values as a function of the inputs. Testing the equivalence of array programs ts shown to be NP-hard If array variables are updated but never subsequently referenced, equivalence can be tested in polynomial time Programs without array varmbles can be tested for equivalence in expected linear t~me

[1]  Zohar Manna,et al.  Introduction to mathematical theory of computation , 1972 .

[2]  Donald M. Kaplan.  Some Completeness Results in the Mathematical Theory of Computation , 1968, JACM.

[3]  Hanan Samet,et al.  Off-line and on-line algorithms for deducing equalities , 1978, POPL.

[4]  Alfred V. Aho,et al.  Equivalence of Programs with Structured Variables , 1972, J. Comput. Syst. Sci..

[5]  Karl N. Levitt,et al.  SELECT - a formal system for testing and debugging programs by symbolic execution , 1975, Reliable Software.

[6]  John Cocke,et al.  Programming languages and their compilers: Preliminary notes , 1969 .

[7]  M HoffmannChristoph,et al.  A Completeness Theorem for Straight-Line Programs with Structured Variables , 1976 .

[8]  Stephen A. Cook,et al.  Proving assertions about programs that manipulate data structures , 1975, STOC.

[9]  Nancy A. Lynch,et al.  Comparison of polynomial-time reducibilities , 1974, STOC '74.

[10]  James C. King,et al.  Symbolic execution and program testing , 1976, CACM.

[11]  Alfred V. Aho,et al.  Optimization of Straight Line Programs , 1972, SIAM J. Comput..

[12]  John McCarthy,et al.  Towards a Mathematical Science of Computation , 1962, IFIP Congress.

[13]  Ravi Sethi,et al.  Conditional Expressions with Equality Tests , 1978, JACM.

[14]  Journal of the Association for Computing Machinery , 1961, Nature.

[15]  Robert L. Constable,et al.  On Classes of Program Schemata , 1972, SIAM J. Comput..

[16]  C. A. R. Hoare,et al.  An Axiomatic Definition of the Programming Language PASCAL , 1973, Acta Informatica.

[17]  Greg Nelson,et al.  Fast decision algorithms based on union and find , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[18]  David C. Luckham,et al.  Automatic program verification V: verification-oriented proof rules for arrays, records and pointers , 1976 .

[19]  K. Culík.  Combinatorial problems in the theory of complexity of algorithmic nets without cycles for simple computers , 1971 .

[20]  Sartaj Sahni,et al.  On the Computational Complexity of Scheme Equivalence , 1974 .

[21]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .