Engineering DPLL(T) + saturation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5195 LNAI, Issue , 2008, Pages 475-490

  De Moura, Leonardo ^a   Bjørner, Nikolaj ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIFFERENTIATION (CALCULUS); FORMAL LOGIC; MATHEMATICAL TECHNIQUES; SPEECH TRANSMISSION; SURFACE MOUNT TECHNOLOGY; TECHNOLOGY;

AUTOMATED REASONING; FIRST-ORDER LOGIC; JOINT CONFERENCE; MODULO THEORIES; SATISFIABILITY;

AUTOMATA THEORY;

EID: 53049092295     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71070-7_40     Document Type: Conference Paper

References (24)

1. Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT Modulo Theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). J. ACM 53, 937-977 (2006)
2. Detlefs, D., Nelson, G., Saxe, J.B.: Simplify: a theorem prover for program checking. J. ACM 52, 365-473 (2005)
3. Ge, Y., Barrett, C., Tinelli, C.: Solving quantified verification conditions using satisfiability modulo theories. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603. Springer, Heidelberg (2007)
4. Moskal, M., Lopuszanski, J., Kiniry, J.R.: E-matching for fun and profit. In: Satisfiability Modulo Theories Workshop (2007)
5. Dutertre, B., de Moura, L.: A Fast Linear-Arithmetic Solver for DPLL(T). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 81-94. Springer, Heidelberg (2006)
6. de Moura, L., Bjørner, N.: Z3: An Efficient SMT Solver. In: TACAS 2008 (2008)
7. Denney, E., Fischer, B., Schumann, J.: Using automated theorem provers to certify auto-generated aerospace software. In: Basin, D., Rusinowitch, M. (eds.) IJCAR, 2004. LNCS (LNAI), vol. 3097. Springer, Heidelberg (2004)
8. Prevosto, V., Waldmann, U.: SPASS+T. In: ESCoR, Workshop (2006)
9. Deharbe, D., Ranise, S.: Satisfiability solving for software verification. International Journal on Software Tools Technology Transfer (to appear, 2008)
10. Bachmair, L., Ganzinger, H.: Resolution theorem proving. In: Handbook of Automated Reasoning, pp. 19-99. MIT Press, Cambridge (2001)
11. Nieuwenhuis, R., Rubio, A.: Paramodulation-based theorem proving. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning. MIT Press, Cambridge (2001)
12. de Moura, L., Bjørner, N.: Relevancy Propagation. Technical Report MSR-TR-2007-140, Microsoft Research (2007)
13. Graf, P.: Substitution tree indexing. In: Hsiang, J. (ed.) RTA 1995. LNCS, vol. 914. Springer, Heidelberg (1995)
14. Schulz, S.: Simple and Efficient Clause Subsumption with Feature Vector Indexing. In: ESFOR Workshop (2004)
15. Baumgartner, P., Fuchs, A., Tinelli, C.: Darwin: A theorem prover for the model evolution calculus. In: ESFOR Workshop (2004)
16. Gallier, J., Narendran, P., Plaisted, D., Raatz, S., Snyder, W.: An algorithm for finding canonical sets of ground rewrite rules in polynomial time. J. ACM 40 (1993)
17. Barnett, M., Leino, K.R.M., Schulte, W.: The Specf# programming system: An overview. In: Barthe, G., Burdy, L., Huisman, M., Lanet, J.-L., Muntean, T. (eds.) CASSIS 2004. LNCS, vol. 3362, pp. 49-69. Springer, Heidelberg (2005)
18. Schulz, S.: E - a brainiac theorem prover. AI Commun 15, 111-126 (2002)
19. Weidenbach, C., Brahm, U., Hillenbrand, T., Keen, E., Theobalt, C., Topic, D.: SPASS version 2.0. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol. 2392, Springer, Heidelberg (2002)
20. Lynch, C.: SMELS: Satisfiability Modulo Equality with Lazy Superposition. The Dagsthul Seminar on Deduction and Decision Procedures (2007)
21. Korovin, K., Voronkov, A.: Integrating linear arithmetic into superposition calculus. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol. 4646, pp. 223-237. Springer, Heidelberg (2007)
22. Fietzke, A.: Labelled splitting. Master's thesis, Saarland University (2007)
23. Riazanov, A., Voronkov, A.: Splitting without backtracking. In: IJCAI (2001)
24. Armando, A., Bonacina, M.P., Ranise, S., Schulz, S.: New results on rewrite-based satisfiability procedures. ACM Transactions on Computational Logic (to appear)