A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
A Quantifier Elimination Algorithm for Linear Real Arithmetic
[chapter]
2008
Lecture Notes in Computer Science
Preserved Fulltext
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
doi:10.1007/978-3-540-89439-1_18
fatcat:y2eqvag35fhojc77awt3qgmyxm