Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/new-results-on-rewrite-based-satisfiability-procedures-RETSreF0JD
References (105)
-
Clark Barrett, D. Dill, Aaron Stump (2002)
Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT -
Clark Barrett, D. Dill, Aaron Stump (2002)
A Generalization of Shostak's Method for Combining Decision Procedures -
M. Bozzano, Roberto Bruttomesso, A. Cimatti, Tommi Junttila, Silvio Ranise, P. Rossum, R. Sebastiani (2005)
Efficient Satisfiability Modulo Theories via Delayed Theory Combination -
R. Nieuwenhuis, A. Rubio (2001)
Paramodulation-Based Theorem Proving -
M. Bonacina (1999)
A Taxonomy of Theorem-Proving Strategies -
Matt Kaufmann, P. Manolios, J. Moore (2000)
Computer-aided reasoning : ACL2 case studies -
L. Moura, S. Owre, H. Ruess, J. Rushby, N. Shankar (2004)
The ICS Decision Procedures for Embedded Deduction -
(2002)
Technical Reports. DIKU, U. Copenhagen -
S. Schulz (2004)
System Description: E 0.81 -
N. Shankar (2002)
Little engines of proofProceedings 17th Annual IEEE Symposium on Logic in Computer Science
-
H. Ganzinger, Viorica Sofronie-Stokkermans, Uwe Waldmann (2006)
Modular proof systems for partial functions with Evans equalityInf. Comput., 204
-
R. Bryant, Shuvendu Lahiri, S. Seshia (2002)
Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions -
M. Moskewicz, Conor Madigan, Ying Zhao, Lintao Zhang, S. Malik (2001)
Chaff: engineering an efficient SAT solverProceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232)
-
Clark Barrett, D. Dill, Aaron Stump (2000)
A Framework for Cooperating Decision Procedures -
P. Downey, R. Sethi, R. Tarjan (1980)
Variations on the Common Subexpression ProblemJournal of the ACM (JACM), 27
-
R. Shostak (1977)
An algorithm for reasoning about equality -
C. Lynch, Barbara Morawska (2002)
Automatic decidabilityProceedings 17th Annual IEEE Symposium on Logic in Computer Science
-
Or Meir, O. Strichman (2005)
Yet Another Decision Procedure for Equality Logic -
Shuvendu Lahiri, S. Seshia (2004)
The UCLID Decision Procedure -
S. Owre, J. Rushby, N. Shankar (1992)
PVS: A Prototype Verification System -
N. Dershowitz (1990)
A Maximal-Literal Unit Strategy for Horn Clauses -
L. Bachmair, A. Tiwari, L. Vigneron (2003)
Abstract Congruence ClosureJournal of Automated Reasoning, 31
-
S. Seshia, Shuvendu Lahiri, R. Bryant (2003)
A hybrid SAT-based decision procedure for separation logic with uninterpreted functionsProceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451)
-
P. Downey, H. Samet, R. Sethi (1978)
Off-line and on-line algorithms for deducing equalitiesProceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
-
P. Brézillon, Paolo Bouquet (1999)
Lecture Notes in Artificial Intelligence -
M. Bonacina, J. Hsiang (1995)
Towards a Foundation of Completion Procedures as Semidecision ProceduresTheor. Comput. Sci., 146
-
B. Dutertre, L. Moura (2006)
A Fast Linear-Arithmetic Solver for DPLL(T) -
S. Krstic, S. Conchon (2005)
Canonization for disjoint unions of theoriesInf. Comput., 199
-
A. Armando, M. Bonacina, Aditya Sehgal, Silvio Ranise (2002)
High-performance deduction for verification: a case study in the theory of arrays -
Nachum Dershowitz, D. Plaisted (2001)
Rewriting -
(2002)
Herbrand Award speech -
L. Moura, H. Ruess, M. Sorea (2002)
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains -
R. Nieuwenhuis, Albert Oliveras (2007)
Fast congruence closure and extensionsInf. Comput., 205
-
C. Flanagan, Rajeev Joshi, Xinming Ou, J. Saxe (2003)
Theorem Proving Using Lazy Proof Explication -
(2004)
Solving linear arithmetic constraints -
S. Schulz (2002)
E - a brainiac theorem proverAI Commun., 15
-
B. Aichernig, T. Maibaum, Iist (2004)
Formal Methods at the Crossroads. From Panacea to Foundational Support, 2757
-
(2003)
Recent systematic treatments appeared in [Krsti´Krsti´c and Conchon -
D. Knuth, P. Bendix (1983)
Simple Word Problems in Universal Algebras -
R. Shostak (1982)
Deciding Combinations of Theories -
M. Bonacina, M. Echenim (2007)
Rewrite-Based Decision Procedures -
Silvio Ranise, C. Ringeissen, Duc-Khanh Tran (2004)
Nelson-Oppen, Shostak and the Extended Canonizer: A Family Picture with a Newborn -
Z. Manna, C. Zarba (2002)
Combining Decision Procedures -
C. Tinelli, M. Harandi (1996)
A New Correctness Proof of the {Nelson-Oppen} Combination Procedure -
Shuvendu Lahiri, M. Musuvathi (2005)
An Efficient Decision Procedure for UTVPI Constraints -
C. Fermüller, A. Leitsch, U. Hustadt, T. Tammet (2001)
Resolution Decision Procedures -
(2000)
J. S. Computer Aided Reasoning -
W. McCune (2003)
OTTER 3.3 Reference ManualArXiv, cs.SC/0310056
-
J. Gallier, P. Narendran, D. Plaisted, Stan Raatz, Wayne Snyder (1993)
An algorithm for finding canonical sets of ground rewrite rules in polynomial timeJ. ACM, 40
-
R. Nieuwenhuis, Albert Oliveras (2005)
DPLL(T) with Exhaustive Theory Propagation and Its Application to Difference Logic -
(2004)
Modularity and refinement in inference systems -
M. Bonacina, M. Echenim (2007)
Rewrite-Based Satisfiability Procedures for Recursive Data Structures -
D. Oppen (1978)
Reasoning about recursively defined data structuresProceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
-
R. Nieuwenhuis, Albert Oliveras (2003)
Congruence Closure with Integer Offsets -
S. Ghilardi, Enrica Nicolini, D. Zucchelli (2005)
A Comprehensive Framework for Combined Decision Procedures -
A. Riazanov, A. Voronkov (2002)
The design and implementation of VAMPIREAI Commun., 15
-
D. Plaisted (1993)
Equational reasoning and term rewriting systems -
S. Conchon, S. Krstic (2003)
Strategies for combining decision proceduresTheor. Comput. Sci., 354
-
(1975)
Canonical inference. Memo ATP-32, Automatic Theorem Proving Project -
D. Dalen (1980)
Logic and structure -
Armando Alessandro, M. Bonacina, Ranise Silvio, S. Stephan (2005)
Big proof engines as little proof engines: new results on rewrite-based satisfiability procedures -
Aaron Stump, Clark Barrett, D. Dill (2002)
CVC: A Cooperating Validity Checker -
(2006)
ACM Transactions on Computational Logic -
H. Ruess, N. Shankar (2001)
Deconstructing ShostakProceedings 16th Annual IEEE Symposium on Logic in Computer Science
-
H. Kirchner, Silvio Ranise, C. Ringeissen, Duc-Khanh Tran (2005)
On Superposition-Based Satisfiability Procedures and Their Combination -
Greg Nelson, D. Oppen (1979)
Simplification by Cooperating Decision ProceduresACM Trans. Program. Lang. Syst., 1
-
F. Baader, S. Ghilardi (2005)
Connecting Many-Sorted Structures and Theories Through Adjoint Functions -
C. Lynch, Duc-Khanh Tran (2007)
Automatic Decidability and Combinability Revisited -
H. Ganzinger, G. Hagen, R. Nieuwenhuis, Albert Oliveras, C. Tinelli (2004)
DPLL( T): Fast Decision Procedures -
G. Necula, Peter Lee (1998)
Efficient representation and validation of proofsProceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226)
-
R. Caferra, A. Leitsch, N. Peltier (2010)
Automated Model Building -
(2004)
Personal communication on ICS 2.0 (e-mail message to Alessandro Armando) -
Christoph Weidenbach (1999)
System Description: Spass Version 1.0.0 -
D. Knuth, P. Bendix (1970)
Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research. -
A. Horn (1951)
On sentences which are true of direct unions of algebrasJournal of Symbolic Logic, 16
-
(2005)
Canonical ground Horn theories Harald Ganzinger Memorial Workshop on Logics of Programming -
D. Jackson, M. Vaziri (2000)
Finding bugs with a constraint solver -
Aaron Stump, Clark Barrett, D. Dill, J. Levitt (2001)
A decision procedure for an extensional theory of arraysProceedings 16th Annual IEEE Symposium on Logic in Computer Science
-
D. Cyrluk, Oliver X, Harald Ruee (1997)
An Eecient Decision Procedure for a Theory of Fixed-sized Bitvectors with Composition and Extraction -
M. Bonacina, N. Dershowitz (2004)
Abstract canonical inferenceACM Trans. Comput. Log., 8
-
Silvio Ranise, C. Ringeissen, C. Zarba (2005)
Combining Data Structures with Nonstably Infinite Theories Using Many-Sorted Logic -
A. Armando, M. Bonacina, Silvio Ranise, S. Schulz (2005)
On a Rewriting Approach to Satisfiability Procedures: Extension, Combination of Theories and an Experimental Appraisal -
Chin-Liang Chang, Richard Lee (1973)
Symbolic logic and mechanical theorem proving -
J. Gallier, P. Narendran, D. Plaisted, Stan Raatz, Wayne Snyder (1988)
Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time -
Shuvendu Lahiri, M. Musuvathi (2005)
An Efficient Nelson-Oppen Decision Procedure for Difference Constraints over Rationals -
D. Plaisted, Andrea Sattler-Klein (1996)
Proof Lengths for Equational CompletionInf. Comput., 125
-
S. Ghilardi (2004)
Model-Theoretic Methods in Combined Constraint SatisfiabilityJournal of Automated Reasoning, 33
-
(2006)
Received April -
David Detlefs, Greg Nelson, J. Saxe (2005)
Simplify: a theorem prover for program checkingJ. ACM, 52
-
D. Cyrluk, P. Lincoln, N. Shankar (1996)
On Shostak's Decision Procedure for Combinations of Theories -
Christoph Weidenbach, R. Schmidt, T. Hillenbrand, R. Rusev, Dalibor Topic (2007)
System Description: SpassVersion 3.0 -
Greg Nelson, D. Oppen (1980)
Fast Decision Procedures Based on Congruence ClosureJ. ACM, 27
-
Clark Barrett, S. Berezin (2004)
CVC Lite: A New Implementation of the Cooperating Validity Checker Category B -
M. Bonacina, S. Ghilardi, Enrica Nicolini, Silvio Ranise, D. Zucchelli (2006)
Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures -
R. Bryant, S. German, M. Velev (1999)
Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logicACM Trans. Comput. Log., 2
-
Aaron Stump, D. Dill (2002)
Faster Proof Checking in the Edinburgh Logical Framework -
D. Déharbe, Silvio Ranise (2003)
Light-weight theorem proving for debugging and verifying units of codeFirst International Conference onSoftware Engineering and Formal Methods, 2003.Proceedings.
-
(2009)
Article 4, Publication date -
S. Stephan, M. Bonacina (2005)
On handling distinct objects in the superposition calculus -
W. McCune (1994)
OTTER 3.0 Reference Manual and Guide -
M. Bozzano, Roberto Bruttomesso, A. Cimatti, Tommi Junttila, P. Rossum, S. Schulz, R. Sebastiani (2005)
An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic -
Konstantine Arkoudas, Karen Zee, Viktor Kunčak, M. Rinard (2004)
Verifying a File System Implementation -
M. Bozzano, Roberto Bruttomesso, A. Cimatti, Tommi Junttila, P. Rossum, S. Schulz, R. Sebastiani (2005)
MathSAT: Tight Integration of SAT and Mathematical Decision ProceduresJournal of Automated Reasoning, 35
-
H. Ganzinger (2002)
Shostak Light -
A. Armando, Silvio Ranise, M. Rusinowitch (2003)
A rewriting approach to satisfiability proceduresInf. Comput., 183
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 2009 by ACM Inc.
- ISSN
- 1529-3785
- DOI
- 10.1145/1459010.1459014
- Publisher site
- See Article on Publisher Site
Abstract
New Results on Rewrite-Based Satis ability Procedures ALESSANDRO ARMANDO Universita degli Studi di Genova ` MARIA PAOLA BONACINA Universita degli Studi di Verona ` SILVIO RANISE LORIA & INRIA-Lorraine and STEPHAN SCHULZ Universita degli Studi di Verona ` Program analysis and veri cation require decision procedures to reason on theories of data structures. Many problems can be reduced to the satis ability of sets of ground literals in theory T . If a sound and complete inference system for rst-order logic is guaranteed to terminate on T satis ability problems, any theorem-proving strategy with that system and a fair search plan is a T -satis ability procedure. We prove termination of a rewrite-based rst-order engine on the theories of records, integer offsets, integer offsets modulo and lists. We give a modularity theorem stating suf cient conditions for termination on a combination of theories, given termination on each. The above theories, as well as others, satisfy these conditions. We introduce several sets of benchmarks on these theories and their combinations, including both parametric synthetic benchmarks to test scalability, and real-world problems to test performances on huge sets of literals. We compare the rewrite-based theorem prover E with the validity
Journal
ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery
Published: Jan 1, 2009