Real quantifier elimination is doubly exponential
Journal of Symbolic Computation
The Omega test: a fast and practical integer programming algorithm for dependence analysis
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)
Property-directed incremental invariant generation
Formal Aspects of Computing
Automatic modular abstractions for linear constraints
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Quantifier Elimination Algorithm for Linear Real Arithmetic
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Feasibility and Infeasibility in Optimization: Algorithms and Computational Methods
Feasibility and Infeasibility in Optimization: Algorithms and Computational Methods
Generalizing DPLL to Richer Logics
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Sufficient preconditions for modular assertion checking
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Optimal abstraction on real-valued programs
SAS'07 Proceedings of the 14th international conference on Static Analysis
Approximate quantifier elimination for propositional boolean formulae
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Transfer function synthesis without quantifier elimination
ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
Abstraction-based algorithm for 2QBF
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Existential quantification as incremental SAT
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Modular abstractions of reactive nodes using disjunctive invariants
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Solving QBF with counterexample guided refinement
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
SAS'12 Proceedings of the 19th international conference on Static Analysis
Abstract interpretation of microcontroller code: Intervals meet congruences
Science of Computer Programming
Model-based synthesis of control software from system-level formal specifications
ACM Transactions on Software Engineering and Methodology (TOSEM)
Complexity-sensitive decision procedures for abstract argumentation
Artificial Intelligence
| Hi-index | 0.00 |
We propose a quantifier elimination scheme based on nested lazy model enumeration through SMT-solving, and projections This scheme may be applied to any logic that fulfills certain conditions; we illustrate it for linear real arithmetic The quantifier elimination problem for linear real arithmetic is doubly exponential in the worst case, and so is our method We have implemented it and benchmarked it against other methods from the literature.