A quantifier elimination algorithm for linear real arithmetic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5330 LNAI, Issue , 2008, Pages 243-257

  Monniaux, David ^a  

^a VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

PROGRAM ANALYSIS; QUANTIFIER ELIMINATIONS; REAL ARITHMETICS; SATISFIABILITY;

ARTIFICIAL INTELLIGENCE; SUBROUTINES;

MOTION ESTIMATION;

EID: 58049126353     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-89439-1_18     Document Type: Conference Paper

References (16)

1. Imbert, J.L.: Fourier's elimination: Which to choose? In: Principles and Practice of Constraint Programming, pp. 117-129 (1993)
2. Bagnara, R., Hill, P.M., Zaffanella, E.: The Parma Polyhedra Library, version 0.9, http://www.cs.unipr.it/ppl
3. Ganzinger, H., Hagen, G., Nieuwenhuis, R., Oliveras, A., Tinelli, C.: DPLL(T): Fast Decision Procedures. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 175-188. Springer, Heidelberg (2004)
4. Nieuwenhuis, R., Oliveras, A.: Fast Congruence Closure and Extensions. Inf. Corn-put. 2005(4), 557-580 (2007)
5. de Moura, L., Rueß, H., Sorea, M.: Lazy theorem proving for bounded model checking over infinite domains. In: Voronkov, A. (ed.) CADE 2002. LNCS, vol. 2392, pp. 438-455. Springer, Heidelberg (2002)
6. Ferrante, J., Rackoff, C.: A decision procedure for the first order theory of real addition with order. SIAM Journal of Computation 4(1), 69-76 (1975)
7. Loos, R., Weispfenning, V.: Applying linear quantifier elimination. The Computer Journal 36(5), 450-462 (1993)
8. Bradley, A.R., Manna, Z.: The Calculus of Computation: Decision Procedures with Applications to Verification. Springer, Heidelberg (2007)
9. Nipkow, T.: Linear quantifier elimination. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS, vol. 5195, pp. 18-33. Springer, Heidelberg (2008)
10. Caviness, B.F., Johnson, J.R. (eds.): Quantifier elimination and cylindrical algebraic decomposition. Springer, Heidelberg (1998)
11. Loos, R., Weispfenning, V.: Applying linear quantifier elimination. The Computer Journal 36(5), 450-462 (1993); Special issue on computational quantifier elimination
12. Monniaux, D.: Optimal abstraction on real-valued programs. In: Riis Nielson, H., File, G. (eds.) SAS 2007. LNCS, vol. 4634, pp. 104-120. Springer, Heidelberg (2007)
13. Tarski, A.: A Decision Method for Elementary Algebra and Geometry. University of California Press (1951)
14. Basu, S., Pollack, R., Roy, M.F.: Algorithms in real algebraic geometry. Algorithms and computation in mathematics. Springer, Heidelberg (2003)
15. Becker, B., Dax, C., Eisinger, J., Klaedtke, F.: LIRA: handling constraints of linear arithmetics over the integers and the reals. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 312-315. Springer, Heidelberg (2007)
16. Pichardie, D.: Interprétation abstraite en logique intuitionniste : extraction d'analyseurs Java certifies. PhD thesis, Université Rennes 1 (2005)