Theory decision by decomposition

Journal of Symbolic Computation

Volumn 45, Issue 2, 2010, Pages 229-260

  Bonacina, Maria Paola ^a   Echenim, Mnacho ^b  

^a UNIVERSITY OF VERONA   (Italy)

^b GRENOBLE INSTITUTE OF TECHNOLOGY   (France)

Author keywords

Automated theorem proving: Rewriting, superposition, paramodulation; Satisfiability modulo theories: Decision procedures, combination of theories

Indexed keywords

EID: 70350718979     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2008.10.008     Document Type: Article

References (58)

1. Arkoudas K., Zee K., Kuncak V., and Rinard M. Verifying a file system implementation. In: Davies J., Schulte W., and Barnett M. (Eds). Proc. 6th ICFEM. LNCS vol. 3308 (2004), Springer 373-390
2. Armando A., Bonacina M.P., Ranise S., and Schulz S. New results on rewrite-based satisfiability procedures. ACM Trans. Comput. Logic 10 1 (2009) 129-179
3. Armando, A., Castellini, C., Giunchiglia, E., Maratea, M., 2004. A SAT-based decision procedure for the Boolean combination of difference constraints. In: Proc. SAT-7
4. Armando A., Ranise S., and Rusinowitch M. A rewriting approach to satisfiability procedures. Inform. and Comput. 183 2 (2003) 140-164
5. Barrett C., Nieuwenhuis R., Oliveras A., and Tinelli C. Splitting on demand in SAT modulo theories. In: Hermann M., and Voronkov A. (Eds). Proc. LPAR-13. LNCS vol. 4246 (2006), Springer 512-526
6. Barrett C.W., Dill D.L., and Stump A. Checking satisfiability of first-order formulas by incremental translation to SAT. In: Larsen K.G., and Brinksma E. (Eds). Proc. CAV-14. LNCS vol. 2404 (2002), Springer 236-249
7. Bonacina M.P. A taxonomy of theorem-proving strategies. In: Wooldridge M.J., and Veloso M. (Eds). Artificial Intelligence Today - Recent Trends and Developments. LNAI vol. 1600 (1999), Springer 43-84
8. Bonacina M.P., and Echenim M. Rewrite-based decision procedures. In: Archer M., de la Tour T.B., and Munoz C. (Eds). Proc. 6th STRATEGIES Workshop, FLoC 2006. ENTCS vol. 174(11) (2007), Elsevier 27-45
9. Bonacina M.P., and Echenim M. Rewrite-based satisfiability procedures for recursive data structures. In: Cook B., and Sebastiani R. (Eds). Proc. 4th PDPAR Workshop, FLoC 2006. ENTCS vol. 174 (8) (2007), Elsevier 55-70
10. Bonacina M.P., and Echenim M. T-decision by decomposition. In: Pfenning F. (Ed). Proc. CADE-21. LNAI vol. 4603 (2007), Springer 199-214
11. Bonacina M.P., and Echenim M. On variable-inactivity and polynomial T-satisfiability procedures. J. Logic Comput. 18 1 (2008) 77-96
12. Bonacina M.P., Ghilardi S., Nicolini E., Ranise S., and Zucchelli D. Decidability and undecidability results for Nelson-Oppen and rewrite-based decision procedures. In: Furbach U., and Shankar N. (Eds). Proc. IJCAR-3. LNAI vol. 4130 (2006), Springer 513-527
13. Bouillaguet C., Kuncak V., Wies T., Zee K., and Rinard M. Using first-order theorem provers in the Jahob data structure verification system. Proc. 8th VMCAI. LNCS vol. 4349 (2007), Springer
14. Bozzano M., Bruttomesso R., Cimatti A., Junttila T., Ranise S., van Rossum P., and Sebastiani R. Efficient theory combination via Boolean search. Inform. and Comput. 204 10 (2006) 1493-1525
15. Bozzano M., Bruttomesso R., Cimatti A., Junttila T., van Rossum P., Schulz S., and Sebastiani R. MathSAT: Tight integration of SAT and mathematical decision procedures. J. Automat. Reason. 35 1-3 (2005) 265-293
16. Bradley, A.R., 2007. Safety analysis of systems. Ph.D. Thesis, Stanford University
17. Bradley A.R., and Manna Z. The Calculus of Computation (2007), Springer
18. Bradley A.R., Manna Z., and Sipma H.B. What's decidable about arrays?. In: Emerson E.A., and Namjoshi K.S. (Eds). Proc. VMCAI-7. LNCS vol. 3855 (2006), Springer 427-442
19. Brand D. Proving theorems with the modification method. SIAM J. Comput. 4 4 (1975) 412-430
20. Bruttomesso, R., 2008. RTL verification: From SAT to SMT(BV). Ph.D. Thesis, Università degli Studi di Trento
21. Bryant R.E., Lahiri S.K., and Seshia S.A. Modeling and verifying systems using a logic of counter arithmetic with lambda expressions and uninterpreted functions. In: Larsen K.G., and Brinksma E. (Eds). Proc. CAV-14. LNCS vol. 2404 (2002), Springer 78-92
22. Bryant R.E., and Velev M.N. Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic. ACM TOCL 2 1 (2001) 93-134
23. Caferra R., Leitsch A., and Peltier N. Automated Model Building (2004), Kluwer Academic Publishers
24. Davis M., Logemann G., and Loveland D. A machine program for theorem-proving. C. ACM 5 7 (1962) 394-397
25. Davis M., and Putnam H. A computing procedure for quantification theory. J. ACM 7 (1960) 201-215
26. de Moura L., and Bjørner N. Efficient E-matching for SMT-solvers. In: Pfenning F. (Ed). Proc. CADE-21. LNAI vol. 4603 (2007), Springer 183-198
27. de Moura L., and Bjørner N. Engineering DPLL(T) + saturation. In: Armando A., Baumgartner P., and Dowek G. (Eds). Proc. IJCAR-4. LNAI vol. 5195 (2008), Springer 475-490
28. de Moura L., and Bjørner N. Model-based theory combination. In: Krstić S., and Oliveras A. (Eds). Proc. 5th SMT Workshop, CAV 2007. ENTCS vol. 198 (2) (2008), Elsevier 37-49
29. de Moura L., Rueß H., and Sorea M. Lazy theorem proving for bounded model checking over infinite domains. In: Voronkov A. (Ed). Proc. CADE-18. LNAI vol. 2392 (2002), Springer 438-455
30. Déharbe D., and Ranise S. Light-weight theorem proving for debugging and verifying units of code. Proc. SEFM-1 (2003), IEEE Computer Society Press 220-228
31. Dershowitz N., and Plaisted D.A. Rewriting. In: Robinson A., and Voronkov A. (Eds). Handbook of Automated Reasoning vol. 1 (2001), Elsevier 535-610
32. Detlefs D.L., Nelson G., and Saxe J.B. Simplify: A theorem prover for program checking. J. ACM 52 3 (2005) 365-473
33. Dutertre B., and de Moura L. A fast linear arithmetic solver for DPLL(T). In: Ball T., and Jones R.B. (Eds). Proc. CAV-18. LNCS vol. 4144 (2006), Springer 81-94
34. Ganzinger H., Sofronie-Stokkermans V., and Waldmann U. Modular proof systems for partial functions with Evans equality. Inform. and Comput. 240 10 (2006) 1453-1492
35. Ge Y., Barrett C., and Tinelli C. Solving quantified verification conditions using satisfiability modulo theories. In: Pfenning F. (Ed). Proc. CADE-21. LNAI vol. 4603 (2007), Springer 167-182
36. Ghilardi S., Nicolini E., Ranise S., and Zucchelli D. Decision procedure for extensions of the theory of arrays. Ann. Math. Artif. Intell. 50 3-4 (2007) 231-254
37. Ghilardi S., Nicolini E., and Zucchelli D. A comprehensive framework for combined decision procedures. In: Gramlich B. (Ed). Proc. 5th FroCoS. LNAI vol. 3717 (2005), Springer 1-30
38. Henzinger T.A., Jhala R., Majumdar R., and Sutre G. Lazy abstraction. Proc. POPL-29 (2002), ACM Press 58-70
39. Jackson D., and Vaziri M. Finding bugs with a constraint solver. In: Harrold M.J. (Ed). Proc. ISSTA 2000 (2000), ACM Press
40. Jacobs S. Incremental instance generation in local reasoning. In: Baader F., Ghilardi S., Hermann M., Sattler U., and Sofronie-Stokkermans V. (Eds). Notes 1st CEDAR Workshop, IJCAR 2008 (2008) 47-62
41. Kirchner H., Ranise S., Ringeissen C., and Tran D.-K. Automatic combinability of rewriting-based satisfiability procedures. In: Hermann M., and Voronkov A. (Eds). Proc. LPAR-13. LNCS vol. 4246 (2006), Springer 542-556
42. Krstić S., and Goel A. Architecting solvers for SAT modulo theories: Nelson-Oppen with DPLL. In: Wolter F. (Ed). Proc. FroCoS-6. LNAI vol. 4720 (2007), Springer 1-27
43. Lahiri S.K., and Musuvathi M. An efficient decision procedure for UTVPI constraints. In: Gramlich B. (Ed). Proc. FroCoS-5. LNAI vol. 3717 (2005), Springer 168-183
44. Lynch C., and Tran D.-K. Automatic decidability and combinability revisited. In: Pfenning F. (Ed). Proc. CADE-21. LNAI vol. 4603 (2007), Springer 328-344
45. Lynch C., and Tran D.-K. Smels: Satisfiability modulo equality with lazy superposition. In: Cha S.D., Choi J.-Y., Kim M., Lee I., and Viswanathan M. (Eds). Proc. ATVA-6. LNCS vol. 5311 (2008), Springer 186-200
46. Meir O., and Strichman O. Yet another decision procedure for equality logic. In: Etessami K., and Rajamani S. (Eds). Proc. CAV-17. LNCS vol. 3576 (2005), Springer 307-320
47. Nelson G., and Oppen D.C. Simplification by cooperating decision procedures. ACM TOPLAS 1 2 (1979) 245-257
48. Nieuwenhuis R., Oliveras A., and Tinelli C. Solving SAT and SAT modulo theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). J. ACM 53 6 (2006) 937-977
49. Nieuwenhuis R., and Rubio A. Paramodulation-based theorem proving. In: Robinson A., and Voronkov A. (Eds). Handbook of Automated Reasoning vol. 1 (2001), Elsevier 371-443
50. Plaisted D.A., and Zhu Y. The Efficiency of Theorem Proving Strategies (1997), Friedr. Vieweg & Sohns
51. Ranise S., and Déharbe D. Light-weight theorem proving for debugging and verifying pointer manipulating programs. In: Dahn I., and Vigneron L. (Eds). Proc. FTP-2003. No. DSCI-II710/03 in Technical Reports (2003), Universidad Politécnica de Valencia 119-132
52. Sebastiani R. Lazy satisfiability modulo theories. J. Satisfiability, Boolean Model. Comput. 3 (2007) 141-224
53. Seshia S.A., Lahiri S.K., and Bryant R.E. A hybrid SAT-based decision procedure for separation logic with uninterpreted functions. In: Fix L., and Lavagno L. (Eds). Proc. 40th DAC (2003) 425-430
54. Sofronie-Stokkermans V. Hierarchic reasoning in local theory extensions. In: Nieuwenhuis R. (Ed). Proc. CADE-20. LNAI vol. 3632 (2005), Springer 219-234
55. Stump A., Barrett C.W., Dill D.L., and Levitt J. A decision procedure for an extensional theory of arrays. In: Halpern J. (Ed). Proc. LICS-16 (2001), IEEE Computer Society Press
56. Waldmann U., and Prevosto V. SPASS + T. In: Sutcliffe G., Schmidt R., and Schulz S. (Eds). Proc. ESCoR Workshop, FLoc 2006. CEUR Workshop Proceedings vol. 192 (2006) 18-33
57. Zhang J. Specification analysis and test data generation by solving Boolean combinations of numeric constraints. Proc. APAQS-1 (2000), IEEE Computer Society Press 267-274
58. Zhang L., and Malik S. The quest for efficient boolean satisfiability solvers. In: Voronkov A. (Ed). Proc. CADE-18. LNCS vol. 2392 (2002), Springer 295-313