The Equivalence Problem of Simple Programs
Journal of the ACM (JACM)
Even Simple Programs Are Hard To Analyze
Journal of the ACM (JACM)
Reversal-Bounded Multicounter Machines and Their Decision Problems
Journal of the ACM (JACM)
The Complexity of Finite Memory Programs with Recursion
Journal of the ACM (JACM)
A Complete and Consistent Hoare Axiomatics for a Simple Programming Language
Journal of the ACM (JACM)
The Complexity of the Equivalence Problem for Simple Programs
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of loop programs
ACM '67 Proceedings of the 1967 22nd national conference
Computation: finite and infinite machines
Computation: finite and infinite machines
Complexity and uniformity of elimination in Presburger arithmetic
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
| Hi-index | 0.00 |
Two of the most powerful classes of programs for which interesting decision problems are known to be solvable are the class of finite-memory programs and the class of programs that characterize the Presburger, or semilinear, sets. In this paper, a new class of programs that presents solvable decision problems similar to the other two classes of programs is introduced. However, the programs in the new class are shown to be computationally more powerful (i.e., capable of defining larger sets of input-output relations).