Verifying and reflecting quantifier elimination for Presburger arithmetic (2005)

Cached

Download Links

by Amine Chaieb , Tobias Nipkow
Venue:LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING
Citations:11 - 7 self

Active Bibliography

8 Verifying mixed real-integer quantifier elimination – Amine Chaieb - 2006
6 Proof synthesis and reflection for linear arithmetic. Submitted – Amine Chaieb, Tobias Nipkow, Technische Universität München - 2006
1 Mechanized quantifier elimination for linear real-arithmetic in Isabelle/HOL – Amine Chaieb, Technische Universität München
4 Generic proof synthesis for presburger arithmetic – Amine Chaieb, Tobias Nipkow, Technische Universität München - 2003
26 An algorithm for deciding BAPA: Boolean Algebra with Presburger Arithmetic – Viktor Kuncak, Huu Hai Nguyen, Martin Rinard - 2005
1 Reflecting Quantifier Elimination for Linear Arithmetic – Tobias Nipkow
A Trustworthy, Extensible Theorem Prover Ph.D. Dissertation Proposal – Jared Davis
8 Automatic modular abstractions for template numerical constraints – David Monniaux - 2010
31 Deciding Boolean Algebra with Presburger Arithmetic – Viktor Kuncak, Huu Hai Nguyen, Martin Rinard
36 Modular Data Structure Verification – Martin C. Rinard - 2007
INTEGRATION OF DECISION PROCEDURES INTO HIGH-ORDER INTERACTIVE PROVERS – Yegor Bryukhov - 2006
15 Fast Reflexive Arithmetic Tactics the linear case and beyond – Frédéric Besson - 2006
21 Certifying machine code safety: Shallow versus deep embedding – Martin Wildmoser, Tobias Nipkow - 2004
10 On the Automata Size for Presburger Arithmetic – Felix Klaedtke - 2004
Quanti er elimination by lazy model enumeration ∗ – David Monniaux - 2010
Automated Reasoning (IJCAR 2012) – unknown authors - 2012
Anatomy of Alternating Quantifier Satisfiability (Work in progress) – Anh-dung Phan, Nikolaj Bjørner, David Monniaux
considered for publication in Logical Methods in Computer Science DECIDING QUANTIFIER-FREE PRESBURGER FORMULAS USING PARAMETERIZED SOLUTION BOUNDS – Sanjit A. Seshia, Randal, E. Bryant - 2005
34 Deciding Quantifier-Free Presburger Formulas Using Finite Instantiation Based on Parameterized Solution Bounds – Sanjit A. Seshia, Randal E. Bryant - 2003