Abstract
We propose a quantifier elimination scheme based on nested lazy model enumeration through SMT-solving, and projections. This scheme may be applied to any logic that fulfills certain conditions; we illustrate it for linear real arithmetic. The quantifier elimination problem for linear real arithmetic is doubly exponential in the worst case, and so is our method. We have implemented it and benchmarked it against other methods from the literature.
This work was partially funded by ANR project “ASOPT”.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Monniaux, D.: Optimal abstraction on real-valued programs. In: Nielson, H.R., Filé, G. (eds.) SAS 2007. LNCS, vol. 4634, pp. 104–120. Springer, Heidelberg (2007)
Monniaux, D.: Automatic modular abstractions for linear constraints. In: POPL (Principles of programming languages). ACM, New York (2009)
Moy, Y.: Sufficient preconditions for modular assertion checking. In: Logozzo, F., Peled, D., Zuck, L.D. (eds.) VMCAI 2008. LNCS, vol. 4905, pp. 188–202. Springer, Heidelberg (2008)
Cox, D., Little, J., O’Shea, D.: Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3rd edn. Springer, Heidelberg (2007)
Kroening, D., Strichman, O.: Decision procedures. Springer, Heidelberg (2008)
Pugh, W.: The Omega test: a fast and practical integer programming algorithm for dependence analysis. In: Supercomputing ’91, pp. 4–13. ACM, New York (1991)
Collins, G.: Quantifier elimination for real closed fields by cylindric algebraic decomposition. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 134–183. Springer, Heidelberg (1975)
Basu, S., Pollack, R., Roy, M.F.: Algorithms in real algebraic geometry, 2nd edn. Algorithms and computation in mathematics. Springer, Heidelberg (2006)
Monniaux, D.: A quantifier elimination algorithm for linear real arithmetic. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS, vol. 5330, pp. 243–257. Springer, Heidelberg (2008)
Ferrante, J., Rackoff, C.: A decision procedure for the first order theory of real addition with order. SIAM J. on Computing 4(1), 69–76 (1975)
Loos, R., Weispfenning, V.: Applying linear quantifier elimination. The Computer Journal, Special issue on computational quantifier elimination 36(5), 450–462 (1993)
Cooper, D.C.: Theorem proving in arithmetic without multiplication. In: Meltzer, B., Michie, D. (eds.) Machine Intelligence, vol. 7, pp. 91–100. Edinburgh University Press, Edinburgh (1972)
Dantzig, G.B., Fulkerson, D.R., Johnson, S.M.: Solution of a large-scale traveling-salesman problem. In: 50 Years of Integer Programming 1958–2008, pp. 7–28. Springer, Heidelberg (2009)
McMillan, K.L., Kuehlmann, A., Sagiv, M.: Generalizing DPLL to richer logics. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 462–476. Springer, Heidelberg (2009)
Cotton, S.: On Some Problems in Satisfiability Solving. PhD thesis, Université Joseph Fourier, Grenoble, France (June 2009)
Ranjan, D.P., Tang, D., Malik, S.: A comparative study of 2QBF algorithms. In: Theory and Applications of Satisfiability Testing (SAT) (May 2004)
Chinneck, J.W.: Finding a useful subset of constraints for analysis in an infeasible linear program. INFORMS J. on Computing 9(2) (1997)
Chinneck, J.W.: Feasibility and infeasibility in optimization. Springer, Heidelberg (2008)
Bradley, A.R., Manna, Z.: Property-directed incremental invariant generation. Formal Aspects of Computing 20(4-5), 379–405 (2008)
Junker, U.: QuickXplain: Conflict detection for arbitrary constraint propagation algorithms. In: IJCAI ’01 workshop CONS-1 (2001)
Bagnara, R., Hill, P.M., Zaffanella, E.: The Parma Polyhedra Library, version 0.9
McMullen, P., Shepard, G.C.: Convex polytopes and the upper bound conjecture. London Mathematical Society lecture note series, vol. 3. Cambridge University Press, Cambridge (1971)
Davenport, J.H., Heintz, J.: Real quantifier elimination is doubly exponential. J. Symb. Comput. 5(1-2), 29–35 (1988)
Fischer, M.J., Rabin, M.O.: Super-exponential complexity of Presburger arithmetic. In: Karp, R. (ed.) Complexity of Computation. SIAM–AMS proceedings, vol. 7, pp. 27–42. American Mathematical Society, Providence (1974)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Monniaux, D. (2010). Quantifier Elimination by Lazy Model Enumeration. In: Touili, T., Cook, B., Jackson, P. (eds) Computer Aided Verification. CAV 2010. Lecture Notes in Computer Science, vol 6174. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14295-6_51
Download citation
DOI: https://doi.org/10.1007/978-3-642-14295-6_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14294-9
Online ISBN: 978-3-642-14295-6
eBook Packages: Computer ScienceComputer Science (R0)