Quantifier Instantiation Techniques for Finite Model Finding in SMT

@inproceedings{Reynolds2013QuantifierIT,
  title={Quantifier Instantiation Techniques for Finite Model Finding in SMT},
  author={Andrew Reynolds and Cesare Tinelli and Amit Goel and Sava Krstic and Morgan Deters and Clark W. Barrett},
  booktitle={CADE},
  year={2013}
}
SMT-based applications increasingly rely on SMT solvers being able to deal with quantified formulas. Current work shows that for formulas with quantifiers over uninterpreted sorts counter-models can be obtained by integrating a finite model finding capability into the architecture of a modern SMT solver. We examine various strategies for on-demand quantifier instantiation in this setting. Here, completeness can be achieved by considering all ground instances over the finite domain of each… Expand
Finite Model Finding in SMT
TLDR
A novel finite model finding method that reduces limitations in the case of quantifiers ranging over free sorts in SMT by not relying on the introduction of domain constants for the free sorts and by being fully integrated into the general architecture used by most SMT solvers. Expand
Conflicts, Models and Heuristics for Quantifier Instantiation in SMT
TLDR
An overview of recent advances in quantifier instantiation in SMT is given, including the well-known technique known as E-matching, and new instantiation-based techniques that are specialized to background theories such as linear real and integer arithmetic are mentioned. Expand
SMT formula Model UNSAT SMT solver Instantiation module
Formal methods applications often rely on SMT solvers to automatically discharge proof obligations. SMT solvers handle quantified formulas using incomplete heuristic techniques like E-matching, andExpand
Constraint solving for finite model finding in SMT solvers*
TLDR
This paper integrates finite model finding techniques based on constraint solving into the architecture used by modern SMT solvers, made possible by a novel solver for cardinality constraints, as well as techniques for on-demand instantiation of quantified formulas. Expand
Revisiting Enumerative Instantiation
TLDR
This paper revisits enumerative instantiation, a technique that considers instantiations based on exhaustive enumeration of ground terms, and presents a stronger Herbrand Theorem, better suited as a basis for the instantiation loop used in SMT solvers. Expand
Syntax-Guided Quantifier Instantiation
This paper presents a novel approach for quantifier instantiation in Satisfiability Modulo Theories (SMT) that leverages syntax-guided synthesis (SyGuS) to choose instantiation terms. It targetsExpand
On Counterexample Guided Quantifier Instantiation for Synthesis in CVC4
We introduce the first program synthesis engine implemented inside an SMT solver. We present an approach that extracts solution functions from unsatisfiability proofs of the negated form of synthesisExpand
Counterexample-Guided Quantifier Instantiation for Synthesis in SMT
We introduce the first program synthesis engine implemented inside an SMT solver. We present an approach that extracts solution functions from unsatisfiability proofs of the negated form of synthesisExpand
On Satisfiability for Quantified Formulas in Instantiation-Based Procedures
Procedures for first-order logic with equality are used in many modern theorem provers and solvers, yet procedure termination in case of interesting sub-classes of satisfiable formulas remains aExpand
Extending SMT Solvers to Higher-Order Logic
TLDR
This work proposes a pragmatic extension for SMT solvers to support HOL reasoning natively without compromising performance on FOL reasoning, thus leveraging the extensive research and implementation efforts dedicated to efficient SMT solving. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 18 REFERENCES
Finite Model Finding in SMT
TLDR
A novel finite model finding method that reduces limitations in the case of quantifiers ranging over free sorts in SMT by not relying on the introduction of domain constants for the free sorts and by being fully integrated into the general architecture used by most SMT solvers. Expand
Incremental Instance Generation in Local Reasoning
TLDR
The incremental instantiation is guided semantically, inspired by the instance generation approach to first-order theorem proving, and shows that for a large class of examples the incremental approach is substantially more efficient than eager generation of all instances. Expand
Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
TLDR
This work presents several decidable fragments of first order logic modulo theories, and shows how to construct models for satisfiable formulas in these fragments. Expand
Efficient E-Matching for SMT Solvers
TLDR
An index that works on E-graphs is introduced, called E-matching code treesthat combine features of substitution and code trees, used in saturation based theorem provers and shows substantial performance improvements over existing state-of-the-art SMT solvers. Expand
New Techniques that Improve MACE-style Finite Model Finding
We describe a new method for finding finite models of unsorted first-order logic clause sets. The method is a MACE-style method, i.e. it ”flattens” the first-order clauses, and for increasing modelExpand
Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL
We offer a transition system representing a high-level but detailed architecture for SMT solvers that combine a propositional SAT engine with solvers for multiple disjoint theories. The systemExpand
iProver - An Instantiation-Based Theorem Prover for First-Order Logic (System Description)
TLDR
The design of iProver is discussed, which is an instantiation-based theorem prover based on Inst-Gen calculus, complete for first-order logic, and a combination of instantiation and ordered resolution. Expand
The model evolution calculus as a first-order DPLL method
TLDR
A new calculus loosely based on FDPLL that is a more faithful lifting of the DPLL procedure and contains a more systematic treatment of universal literals, which are crucial to achieve efficiency in practice. Expand
Extending Sledgehammer with SMT Solvers
TLDR
Sledgehammer was extended to invoke satisfiability modulo theories (SMT) solvers as well, exploiting its relevance filter and parallel architecture and is now pleasantly surprised by SMT proofs for problems beyond the ATPs’ reach. Expand
Protocol Proof Checking Simplified with SMT
  • M. Tuttle, A. Goel
  • Computer Science
  • 2012 IEEE 11th International Symposium on Network Computing and Applications
  • 2012
TLDR
It is shown how DVF can be used to prove correct a classical, fault-tolerant, distributed protocol for consensus, and described how a protocol expert starting from scratch was able to model the protocol and prove it correct in six days and nine pages. Expand
...
1
2
...