The SAT-based approach to separation logic

Journal of Automated Reasoning

Volumn 35, Issue 1-3, 2005, Pages 237-263

  Armando, Alessandro ^a   Castellini, Claudio ^a   Giunchiglia, Enrico ^a   Maratea, Marco ^a  

^a UNIVERSITY OF GENEVA   (Switzerland)

Author keywords

SAT based decision procedures; Separation logic

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; CODES (SYMBOLS); CONSTRAINT THEORY; DECISION THEORY; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES;

PSEUDO-CODE REPRESENTATION; REAL-WORLD INSTANCES; SAT DECISION PROCEDURES; SATISFIABILITY; SEPARATION LOGIC (SL);

FORMAL LOGIC;

EID: 33750318209     PISSN: 01687433     EISSN: 15730670     Source Type: Journal    
DOI: 10.1007/s10817-005-9002-1     Document Type: Article

References (41)

1. Armando, A. and Giunchiglia, E. (1993) Embedding complex decision procedures inside an interactive theorem prover, Ann. Math. Artif. Intell. 8(3-4), 475-502.
2. Armando, A., Castellini, C. and Giunchiglia, E. (1999) SAT-based procedures for temporal reasoning, in S. Biundo and M. Fox (eds.), Proceedings of the 5th European Conferevace on Planning (Durham, UK), Vol. 1809 of Lecture Notes in Computer Science, Springer, pp. 97-108.
3. Armando, A., Castellini, C., Giunchiglia, E., Idini, M. and Maratea, M. (2004) TSAT++: an open platform for satisfiability modulo theories, in Proceedings of PDPAR, Pragmatics of Decision Procedures in Automated Reasoning, Cork (Ireland), Vol. 125, Issue 3 of ENTCS, Elsevier, pp. 25-36.
4. Armando, A., Castellini, C., Giunchiglia, E. and Maratea, M. (2005a) A SAT-based decision procedure for the boolean combination of difference constraints, in Proceedings of SAT, International Conference on Theory and Applications of Satisfiability Testing, Vancouver (Canada), Vol. 3542 of LNCS, Springer, pp. 16-29.
5. Armando, A., Castellini, C., Giunchiglia, E., Giunchiglia, F. and Tacchella, A. (2005b) SAT-based decision procedures for automated reasoning: a unifying perspective, in Mechanizing Mathematical Reasoning: Essays in Honor of Jrg H. Siekmann on the Occasion of His 60th Birthday, Vol. 2605 of Lecture Notes in Computer Science, Springer.
6. Audemard, G., Bertoli, P., Cimatti, A., Kornilowicz, A. and Sebastiani, R. (2002) A SAT based approach for solving formulas over Boolean and linear mathematical propositions, in A. Voronkov (ed.), Automated Deduction - CADE-18, Vol. 2392 of Lecture Notes in Computer Science, Springer, pp. 195-210.
7. Barrett, C. W. and Berezin, S. (2004) CVC Lite: a new implementation of the cooperating validity checker category B, in 16th International Conference on Computer Aided Verification (CAV'04), Vol. 3114, Springer, pp. 515-518.
8. Bayardo, Jr., R. J. and Miranker, D. P. (1996) A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem, in Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference, Menlo Park, AAAI/MIT, pp. 298-304.
9. Berkelaar, M. (1997) The lp_solve Solver for Mixed Integer-Linear Programming. Version 2.2. Available at http://www.cs.sunysb.edu/~algorith/ implement/lpsolve/implement.shtml.
10. Böhm, M. and Speckenmeyer, E. (1996) A fast parallel SAT-solver - efficient workload balancing, Ann. Math. Artif. Intell 17, 381-400.
11. Bryant, R. E., Lahiri, S. K. and Seshia, S. A. (2002) Deciding CLU logic formulas via Boolean and pseudo-Boolean encodings, in Proceedings of International Workshop on Constraints in Formal Verification. Associated with International Conference on Principles and Practice of Constraint Programming, Ithaca, New York (USA).
12. Castellini, C., Giunchiglia, E. and Tacchella, A. (2003) SAT-based planning in complex domains: concurrency, constraints and nondeterminism, Artif. Intel!. 147, 85-117.
13. Cormen, T. H., Leiserson, C. E., Rivest, R. L. and Stein, C. (2001) Introduction to Algorithms, MIT.
14. Cotton, S., Asarin, E., Maler, O. and Niebert, P. (2004) Some progress in satisfiability checking for difference logic, in Joint International Conferences on Formal Modelling and Analysis of Timed Systems (FORMATS) and Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT), Vol. 3253 of Lecture Notes in Computer Science, Springer, pp. 263-276.
15. D'Agostino, M. (1992) Are tableaux an improvement on truth-tables? J. Logic, Lang. Inf. 1, 235-252.
16. Davis, M., Logemann, G. and Loveland, D. (1962) A machine program for theorem proving, Journal of the ACM 5(7).
17. de Moura, L., Ruess, H., Shankar, N. and Rushby, J. (2004) The ICS decision procedures for embedded deduction, in Proceedings of IJCAR, International Joint Conference on Automated Reasoning, Cork, Ireland.
18. Dechter, R., Mein, I. and Pearl, J. (1989) Temporal constraint networks, in H. J. L. R. J. Brachman and R. Reiter (eds.), Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning, Toronto, Canada, Morgan Kaufmann, pp. 83-93.
19. Dequen, G. and Dubois, O. (2004) kcnfs: an efficient solver for random K-Sat formulae, in E. Giunchiglia and A. Taicchella (eds.), 6th International Conference on Theory an Applications of Satisfiability Testing. Selected Revised Papers, Vol. 2919 of Lecture Notes in Computer Science, Springer, pp. 486-501.
20. Flanagan, C., Joshi, R., Ou, X. and Saxe, J. B. (2003) Theorem proving using lazy proof explication, in 15th International Conference on Computer Aided Verification (CAV'03), Vol. 2725, Springer, pp. 355-367.
21. Gent, I., Maaren, H. V. and Walsh, T. (eds.) (2000) SAT2000. Highlights of Satisfiability Research in the Year 2000, IOS.
22. Giunchiglia, F. and Sebastiani, R. (1996) Building decision procedures for modal logics from prepositional decision procedures - the case study of modal K, in Proc. CADE-96, New Brunswick, New Jersey, USA, Springer.
23. Giunchiglia, E., Maratea, M., Tacchella, A. and Zambonin, D. (2001) Evaluating search heuristics and optimization techniques in propositional satisfiability, in Automated Reasoning, First International Joint Conference (IJCAR), Vol. 2083 of Lecture Notes an Computer Science, Springer, pp. 347-363.
24. Giunchiglia, E., Giunchiglia, F. and Tacchella, A. (2002) SAT-based decision procedures for classical modal logics, J. Autom. Reason. 28, 143-171. Reprinted in (Gent et al., 2000).
25. Giunchiglia, E., Maratea, M. and Tacchella, A. (2003) (In)Effectiveness of look-ahead techniques in a modern SAT solver, in Principles and Practice of Constraint Programming (CP), Vol. 2833 of Lecture Notes in Computer Science, Springer, pp. 842-846.
26. Heule, M. and Maaren, H. V. (2005) March_eq: implementing additional reasoning into an efficient look-ahead SAT solver, in 8th International Conference on Theory an Applications of Satisfiability Testing, Vol. 3542 of LNCS, Springer, pp. 345-353.
27. Lahiri, S. K., Seshia, S. A. and Bryant, B. (2002) Modeling and verification of out-of-order microprocessors in UCLID, Lect. Notes Comput. Sci. 2517, 142-155.
28. Le Berre, D. and Simon, L. (2003) The essentials of the SAT'03 competition, in Proceedings of the 6th International Conference on the Theory and Applications of Satisfiability Testing (SAT'03). Selected revised papers, Vol. 2919 of LNCS.
29. Moskewicz, M. W., Madigan, C. F., Zhao, Y., Zhang, L. and Malik, S. (2001) Chaff: engineering an efficient SAT solver, in Proceedings of the 38th Design Automation Conference (DAC'01).
30. Oddi, A. and Cesta, A. (2000) Incremental forward checking for the disjunctive temporal problem, in Proceedings of the 14th European Conference on Artificial Intelligence (ECAI-2000), Berlin, pp. 108-112.
31. Plaisted, D. and Greenbaum, S. (1986) A structure-preserving clause form translation, J. Symb. Comput. 2, 293-304.
32. Pratt, V. R. (1977) Two easy theories whose combination is hard, Technical report, Massachusetts Institute of Technology.
33. Prosser, P. (1993) Domain filtering can degrade intelligent backjumping search, in Proc. IJCAI, pp. 262-267.
34. Siekmann, J. and Wrightson, G. (eds.) (1983) Automation of Reasoning: Classical Papers in Computational Logic 1967-1970, Vol. 1-2, Springer.
35. Stergiou, K. and Koubarakis, M. (1998) Backtracking algorithms for disjunctions of temporal constraints, in Proceedings of AAAI/IAAI, Madison, WI (USA), pp. 248-253.
36. Stergiou, K. and Koubarakis, M. (2000) Backtracking algorithms for disjunctions of temporal constraints, Artif. Intell. 120(1), 81-117.
37. Strichman, O., Seshia, S. A. and Bryant, R. E. (2002) Deciding separation formulas with SAT, Lect. Notes Comput. Sci. 2404, 209-222.
38. Stump, A., Barren, C. W. and Dill, D. L. (2002) CVC: a cooperating validity checker, in J. C. Godskesen (ed.), Proceedings of the International Conference on Computer-Aided Verification.
39. Tsamardinos, I. and Pollack, M. (2003) Efficient solution techniques for disjunctive temporal reasoning problems, Artif. Intell. 151, 43-89.
40. Tseitin, G. (1970) On the complexity of proofs in propositional logics, Semin. Mat, 8. Reprinted in (Siekmann and Wrightson, 1983).
41. Wolfman, S. and Weld, D. (1999) The LPSAT-engine and its application to resource planning, in Proceedings IJCAI-99.