 |
|
|
|
| HAL: hal-00262312, version 2 |
| arXiv: 0803.1575 |
| DOI: 10.1007/978-3-540-89439-1_18 |
| Detailed view |  Export this paper |
|
|
| LPAR ( Logic for Programming, Artificial Intelligence, and Reasoning), Doha : Qatar (2008) |
|
|
| Available versions: | v1 (2008-03-11) | v2 (2008-09-04) |
|
|
|
|
| A Quantifier Elimination Algorithm for Linear Real Arithmetic |
|
|
David Monniaux 1 |
|
|
| (2008-11-17) |
|
|
|
| We propose a new quantifier elimination algorithm for the theory of linear real arithmetic. This algorithm uses as subroutine satisfiability modulo this theory, a problem for which there are several implementations available. The quantifier elimination algorithm presented in the paper is compared, on examples arising from program analysis problems, to several other implementations, all of which cannot solve some of the examples that our algorithm solves easily. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | VERIMAG (VERIMAG - IMAG) |
|
|
|
CNRS : UMR5104 РUniversit̩ Joseph Fourier - Grenoble I РInstitut National Polytechnique de Grenoble (INPG) |
|
|
|
|
|
|
|
|
|
| Synchrone |
|
|
|
|
| Subject | : | Computer Science/Logic in Computer Science |
|
|
| Attached file list to this document: | ||||||||||
|
||||||||||
|
|
|
| hal-00262312, version 2 | |
| http://hal.archives-ouvertes.fr/hal-00262312 | |
| oai:hal.archives-ouvertes.fr:hal-00262312 | |
| From: David Monniaux | |
| Submitted on: Thursday, 4 September 2008 18:57:12 | |
| Updated on: Monday, 17 November 2008 11:36:38 | |
