作者: David Monniaux
DOI: 10.1007/978-3-540-89439-1_18
关键词: Conjunctive normal form 、 Elimination theory 、 Satisfiability 、 Mathematics 、 Quantifier elimination 、 Projection (set theory) 、 Modulo 、 Linear inequality 、 Algorithm 、 Disjunctive normal form
摘要: We propose a new quantifier elimination algorithm for the theory of linear real arithmetic. This uses as subroutines satisfiability modulo this and polyhedral projection; there are good algorithms implementations both these. The presented in paper is compared, on examples arising from program analysis problems random examples, to several other implementations, all which cannot solve some that our solves easily.