58 search results - page 3 / 12 » A Quantifier Elimination Algorithm for Linear Real Arithmeti... |
ESOP
2008
Springer
13 years 9 months ago
2008
Springer
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
c Modular Abstractions for Template Numerical Constraints David Monniaux May 26, 2010 We propose a method for automatically generating abstract transformstatic analysis by abstrac...
AML
2005
13 years 7 months ago
2005
Abstract. We investigate the theories LA, LAP, LAP of linear algebra, which were originally defined to study the question of whether commutativity of matrix inverses has polysize F...
AAECC
1999
Springer
13 years 7 months ago
1999
Springer
Effective quantifier elimination procedures for the reals allow to solve problems that can be encoded into corresponding first-order formulas including ordering constraints. In con...
CADE
2009
Springer
14 years 8 months ago
2009
Springer
Scalable handling of real arithmetic is a crucial part of the verification of hybrid systems, mathematical algorithms, and mixed analog/digital circuits. Despite substantial advanc...