On the zero-inequivalence problem for loop programs
From MaRDI portal
Publication:1171383
DOI10.1016/0022-0000(83)90020-XzbMath0498.68030MaRDI QIDQ1171383
Brian S. Leininger, Oscar H. Ibarra
Publication date: 1983
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(83)90020-x
Cites Work
- Unnamed Item
- Unnamed Item
- Some simplified undecidable and NP-hard problems for simple programs
- On the complexity of simple arithmetic expressions
- On the Computational Complexity of Program Scheme Equivalence
- The Complexity of the Equivalence Problem for Simple Programs
- Complexity of automaton identification from given data
- A Complete and Consistent Hoare Axiomatics for a Simple Programming Language
- Reduction of an arbitrary diophantine equation to one in 13 unknowns
- The Equivalence Problem of Simple Programs
- The complexity of theorem-proving procedures