A Quantifier Elimination Algorithm for Linear Real Arithmetic [chapter]

David Monniaux
2008 Lecture Notes in Computer Science  
We propose a new quantifier elimination algorithm for the theory of linear real arithmetic. This algorithm uses as subroutines satisfiability modulo this theory and polyhedral projection; there are good algorithms and implementations for both of these. The quantifier elimination algorithm presented in the paper is compared, on examples arising from program analysis problems and on random examples, to several other implementations, all of which cannot solve some of the examples that our
more » ... solves easily. * VERIMAG is a joint laboratory of CNRS, Université Joseph Fourier and Grenoble INP.
doi:10.1007/978-3-540-89439-1_18 fatcat:y2eqvag35fhojc77awt3qgmyxm