A Quantifier Elimination Algorithm for Linear Real Arithmetic

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 algorithm solves easily.

• Type: Journal
• Year: 2008
• Where: CORR
• Authors: David Monniaux
• Keywords: CORR 2008, Education, Polyhedral Projection, Program Analysis Problems, Quantifier Elimination Algorithm