Deciding array formulas with frugal axiom instantiation

Authors:
Amit Goel;Sava Krstić;Alexander Fuchs
Affiliations:
Intel Corporation;Intel Corporation;The University of Iowa
Venue:
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
Year:
2008

Citing 13
Cited 6

Simplification by Cooperating Decision Procedures

ACM Transactions on Programming Languages and Systems (TOPLAS)
Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
A rewriting approach to satisfiability procedures

Information and Computation - RTA 2001
A Decision Procedure for an Extensional Theory of Arrays

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Simplify: a theorem prover for program checking

Journal of the ACM (JACM)
Efficient theory combination via boolean search

Information and Computation - Special issue: Combining logical systems
Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)

Journal of the ACM (JACM)
Decision procedures for extensions of the theory of arrays

Annals of Mathematics and Artificial Intelligence
Back to the future: revisiting precise program verification using SMT solvers

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Combined satisfiability modulo parametric theories

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Z3: an efficient SMT solver

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Splitting on demand in SAT modulo theories

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
What's decidable about arrays?

VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation

A write-based solver for SAT modulo the theory of arrays

Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
Flexible interpolation with local proof transformations

Proceedings of the International Conference on Computer-Aided Design
An Instantiation Scheme for Satisfiability Modulo Theories

Journal of Automated Reasoning
The MathSAT5 SMT solver

TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Instantiation Schemes for Nested Theories

ACM Transactions on Computational Logic (TOCL)
Array Theory of Bounded Elements and its Applications

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

How to efficiently reason about arrays in an automated solver based on decision procedures? The most efficient SMT solvers of the day implement "lazy axiom instantiation": treat the array operations read and write as uninterpreted, but supply at appropriate times appropriately many---not too many, not too few---instances of array axioms as additional clauses. We give a precise account of this approach, specifying "how many" is enough for correctness, and showing how to be frugal and correct.