Array Theory of Bounded Elements and its Applications

Authors:
Min Zhou;Fei He;Bow-Yaw Wang;Ming Gu;Jiaguang Sun
Affiliations:
School of Software, Tsinghua University, Beijing, China 100084 and Tsinghua National Laboratory for Information Science and Technology, Beijing, China and Key Laboratory for Information System Sec ...;School of Software, Tsinghua University, Beijing, China 100084 and Tsinghua National Laboratory for Information Science and Technology, Beijing, China and Key Laboratory for Information System Sec ...;Academia Sinica, Taipei, Taiwan;School of Software, Tsinghua University, Beijing, China 100084 and Tsinghua National Laboratory for Information Science and Technology, Beijing, China and Key Laboratory for Information System Sec ...;School of Software, Tsinghua University, Beijing, China 100084 and Tsinghua National Laboratory for Information Science and Technology, Beijing, China and Key Laboratory for Information System Sec ...
Venue:
Journal of Automated Reasoning
Year:
2014

Citing 23
Cited 0

Presburger arithmetic with unary predicates is P11 complete

Journal of Symbolic Logic
Verification Decidability of Presburger Array Programs

Journal of the ACM (JACM)
An axiomatic basis for computer programming

Communications of the ACM
Solving Bit-Vector Equations

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
Decision procedures for extensions of the theory of arrays

Annals of Mathematics and Artificial Intelligence
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Efficient E-Matching for SMT Solvers

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
A Logic of Singly Indexed Arrays

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Lemmas on demand for the extensional theory of arrays

SMT '08/BPR '08 Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning
Deciding array formulas with frugal axiom instantiation

SMT '08/BPR '08 Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning
A write-based solver for SAT modulo the theory of arrays

Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays

TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Automatic Verification of Integer Array Programs

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
A decision procedure for bit-vectors and arrays

CAV'07 Proceedings of the 19th international conference on Computer aided verification
What's decidable about sequences?

ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Efficiently solving quantified bit-vector formulas

Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
On array theory of bounded elements

CAV'10 Proceedings of the 22nd 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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate a first-order array theory of bounded elements. This theory has rich expressive power that allows free use of quantifiers. By reducing to weak second-order logic with one successor (WS1S), we show that the proposed array theory is decidable. Then two natural extensions to the new theory are shown to be undecidable. A translation-based decision procedure for this theory is implemented, and is shown applicable to program verification.