Virtual Substitution for SMT-Solving
SMT-solving aims at deciding satisfiability for the existential fragment of a first-order theory. A SAT-solver handles the logical part of a given problem and invokes an embedded theory solver to check consistency of theory constraints. For efficiency, the theory solver should be able to work incrementally and generate infeasible subsets. Currently available decision procedures for real algebra – the first-order theory of the reals with addition and multiplication – do not exhibit these features. In this paper we present an adaptation of the virtual substitution method, providing these abilities.
KeywordsDecision Procedure Consistency Check Conjunction Node Side Condition Left Endpoint
Unable to display preview. Download preview PDF.
- [Bjo99]Bjorner, N.S.: Integrating Decision Procedures for Temporal Verification. PhD thesis, Stanford University (1999)Google Scholar
- [BPT07]Bauer, A., Pister, M., Tautschnig, M.: Tool-support for the analysis of hybrid systems and models. In: DATE 2007, pp. 924–929. European Design and Automation Association (2007)Google Scholar
- [Cor11]Corzilius, F.: Virtual substitution in SMT solving. Master’s thesis, RWTH Aachen University (2011), http://www-i2.informatik.rwth-aachen.de/i2/publications/
- [DS97]Dolzmann, A., Sturm, T.: REDLOG: Computer algebra meets computer logic. In: SIGSAM 1997, vol. 31, pp. 2–9 (1997)Google Scholar
- [DSW97]Dolzmann, A., Sturm, T., Weispfenning, V.: Real quantifier elimination in practice (1997)Google Scholar