Assignment commands and array structures

Straight line programs in which array elements can be referenced and set are considered. Two programs are equivalent if they compute the same expression as a function of the inputs. Testing the equivalence of programs with arrays is shown to be NP-complete, while programs without arrays can be tested for equivalence in linear time. Equivalence testing takes polynomial time when programs have either no references or no assignments to array elements.

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

[2]  Robert E. Tarjan,et al.  Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..

[3]  Donald B. Johnson.  On the Power of Arrays In Universal Languages , 1973 .

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

[5]  Ravi Sethi,et al.  Scheduling Graphs on Two Processors , 1976, SIAM J. Comput..

[6]  Alfred V. Aho,et al.  The Theory of Parsing, Translation, and Compiling , 1972 .

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

[8]  David C. Luckham,et al.  On Formalised Computer Programs , 1970, J. Comput. Syst. Sci..

[9]  Ravi Sethi,et al.  Testing for the Church-Rosser Property , 1974, JACM.

[10]  Karl N. Levitt,et al.  SELECT—a formal system for testing and debugging programs by symbolic execution , 1975 .

[11]  B. F. Caviness.  On Canonical Forms and Simplification , 1970, JACM.

[12]  James C. King,et al.  A new approach to program testing , 1974, Programming Methodology.

[13]  Ravi Sethi.  Errata: `` Testing for the Church-Rosser Property'' , 1975, JACM.

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

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

[16]  Christoph M. Hoffmann,et al.  A Completeness Theorem for Straight-Line Programs with Structured Variables , 1976, J. ACM.

[17]  Robert L. Constable,et al.  On Classes of Program Schemata , 1971, SWAT.

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