Presburger arithmetic with unary predicates is P11 complete
Journal of Symbolic Logic
Verification Decidability of Presburger Array Programs
Journal of the ACM (JACM)
FMCAD '98 Proceedings of the Second International Conference on Formal Methods in Computer-Aided Design
Mona: Monadic Second-Order Logic in Practice
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Mona & Fido: The Logic-Automaton Connection in Practice
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
A Decision Procedure for an Extensional Theory of Arrays
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Techniques for program verification
Techniques for program verification
A Logic of Singly Indexed Arrays
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Automatic Verification of Integer Array Programs
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
What's decidable about arrays?
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Array Theory of Bounded Elements and its Applications
Journal of Automated Reasoning
Hi-index | 0.00 |
We investigate a first-order array theory of bounded elements By reducing to weak second-order logic with one successor (WS1S), we show that the proposed array theory is decidable Finally, two natural extensions to the new theory are shown to be undecidable.