A Quantifier Elimination Algorithm for Linear Real Arithmetic - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

A Quantifier Elimination Algorithm for Linear Real Arithmetic

David Monniaux
Connectez-vous pour contacter l'auteur

Abstract

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.
Fichier principal
Vignette du fichier
monniaux-lpar08-article.pdf (246.78 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00262312 , version 1 (11-03-2008)
hal-00262312 , version 2 (04-09-2008)

Identifiers

Cite

David Monniaux. A Quantifier Elimination Algorithm for Linear Real Arithmetic. LPAR ( Logic for Programming, Artificial Intelligence, and Reasoning), Nov 2008, Doha, Qatar. pp.243-257, ⟨10.1007/978-3-540-89439-1_18⟩. ⟨hal-00262312v2⟩
161 View
538 Download

Altmetric

Share

Gmail Facebook X LinkedIn More