Efficient theory combination via boolean search

[1]  Wilhelm Ackermann,et al.  Solvable Cases Of The Decision Problem , 1954 .

[2]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

[3]  Greg Nelson,et al.  Simplification by Cooperating Decision Procedures , 1979, TOPL.

[4]  Derek C. Oppen,et al.  Complexity, Convexity and Combinations of Theories , 1980, Theor. Comput. Sci..

[5]  Robert E. Shostak,et al.  Deciding Combinations of Theories , 1982, JACM.

[6]  Larry Wos,et al.  What Is Automated Reasoning? , 1987, J. Autom. Reason..

[7]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[8]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[9]  Cesare Tinelli,et al.  A New Correctness Proof of the {Nelson-Oppen} Combination Procedure , 1996, FroCoS.

[10]  Joao Marques-Silva,et al.  GRASP-A new search algorithm for satisfiability , 1996, Proceedings of International Conference on Computer Aided Design.

[11]  Roberto J. Bayardo,et al.  Using CSP Look-Back Techniques to Solve Real-World SAT Instances , 1997, AAAI/IAAI.

[12]  Bart Selman,et al.  Boosting Combinatorial Search Through Randomization , 1998, AAAI/IAAI.

[13]  M. Moskewicz,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[14]  Natarajan Shankar,et al.  ICS: Integrated Canonizer and Solver , 2001, CAV.

[15]  Natarajan Shankar,et al.  Deconstructing Shostak , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[16]  Natarajan Shankar,et al.  Combining Shostak Theories , 2002, RTA.

[17]  Ofer Strichman,et al.  Deciding Separation Formulas with SAT , 2002, CAV.

[18]  Stephan Schulz,et al.  E - a brainiac theorem prover , 2002, AI Commun..

[19]  David L. Dill,et al.  A Generalization of Shostak's Method for Combining Decision Procedures , 2002, FroCoS.

[20]  Calogero G. Zarba,et al.  Combining Sets with Integers , 2002, FroCoS.

[21]  Ofer Strichman.  On Solving Presburger and Linear Arithmetic with SAT , 2002, FMCAD.

[22]  Xinming Ou,et al.  Theorem Proving Using Lazy Proof Explication , 2003, CAV.

[23]  Cesare Tinelli,et al.  Unions of non-disjoint theories and combinations of satisfiability procedures , 2003, Theor. Comput. Sci..

[24]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[25]  Calogero G. Zarba,et al.  Combining Non-Stably Infinite Theories , 2003, FTP.

[26]  Silvio Ranise,et al.  Light-weight theorem proving for debugging and verifying units of code , 2003, First International Conference onSoftware Engineering and Formal Methods, 2003.Proceedings..

[27]  Sanjit A. Seshia,et al.  A hybrid SAT-based decision procedure for separation logic with uninterpreted functions , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).

[28]  Albert Oliveras,et al.  Congruence Closure with Integer Offsets , 2003, LPAR.

[29]  Eugene Asarin,et al.  Some Progress in Satisfiability Checking for Difference Logic , 2004, FORMATS/FTRTFT.

[30]  Sanjit A. Seshia,et al.  Deciding quantifier-free Presburger formulas using parameterized solution bounds , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[31]  Joël Ouaknine,et al.  Abstraction-Based Satisfiability Solving of Presburger Arithmetic , 2004, CAV.

[32]  Shuvendu K. Lahiri,et al.  Zapato: Automatic Theorem Proving for Predicate Abstraction Refinement , 2004, CAV.

[33]  Sergey Berezin,et al.  CVC Lite: A New Implementation of the Cooperating Validity Checker Category B , 2004, CAV.

[34]  Christophe Ringeissen,et al.  Nelson-Oppen, Shostak and the Extended Canonizer: A Family Picture with a Newborn , 2004, ICTAC.

[35]  Enrico Giunchiglia,et al.  A SAT-based Decision Procedure for the Boolean Combination of Difference Constraints , 2004, SAT.

[36]  Cesare Tinelli,et al.  DPLL( T): Fast Decision Procedures , 2004, CAV.

[37]  Marco Bozzano,et al.  An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic , 2005, TACAS.

[38]  Marco Bozzano,et al.  Efficient Satisfiability Modulo Theories via Delayed Theory Combination , 2005, CAV.

[39]  Calogero G. Zarba,et al.  Combining Nonstably Infinite Theories , 2005, Journal of Automated Reasoning.

[40]  J. Urry.  Complexity , 2006, Interpreting Art.