Combining theories with shared set operations

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

Volumn 5749 LNAI, Issue , 2009, Pages 366-382

  Wies, Thomas ^a   Piskac, Ruzica ^a   Kuncak, Viktor ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED REASONING; CARDINALITY CONSTRAINTS; COUNTING QUANTIFIERS; FINITE STRUCTURES; FIRST-ORDER LOGIC WITH EQUALITY; MONADIC SECOND-ORDER LOGIC; MULTI-SETS; PRESBURGER ARITHMETIC; QUANTIFIER-FREE LOGIC; RAMSEY CLASS; SATISFIABILITY PROBLEMS; SECOND ORDERS; SET OPERATION; SET VARIABLES; SOFTWARE VERIFICATION;

AUTOMATA THEORY; BOOLEAN ALGEBRA; VERIFICATION;

COMPUTABILITY AND DECIDABILITY;

EID: 76749121561     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04222-5_23     Document Type: Conference Paper

References (36)

1. Andrews, P.B.: An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof, 2nd edn. Springer (Kluwer), Heidelberg (2002)
2. Ball, T., Podelski, A., Rajamani, S.K.: Relative completeness of abstraction refinement for software model checking. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, p. 158. Springer, Heidelberg (2002)
3. Barnett, M., DeLine, R., Fähndrich, M., Leino, K.R.M., Schulte, W.: Verification of object-oriented programs with invariants. Journal of Object Technology 3(6), 27-56 (2004)
4. Barrett, C., Tinelli, C.: CVC3. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 298-302. Springer, Heidelberg (2007)
5. Basin, D., Friedrich, S.: Combining WS1S and HOL. In: FroCoS (1998)
6. Börger, E., Grädel, E., Gurevich, Y.: The Classical Decision Problem. Springer, Heidelberg (1997)
7. Boyer, R.S., Moore, J.S.: Integrating decision procedures into heuristic theorem provers: A case study of linear arithmetic. In: Machine Intelligence, vol. 11. Oxford University Press, Oxford (1988)
8. de Moura, L., Bjørner, N.: Z3: An efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337-340. Springer, Heidelberg (2008)
9. Feferman, S., Vaught, R.L.: The first order properties of products of algebraic systems. Fundamenta Mathematicae 47, 57-103 (1959)
10. Fontaine, P.: Combinations of theories and the bernays-schönfinkel- ramsey class. In: VERIFY (2007)
11. Fontaine, P.: Combinations of theories for decidable fragments of first-order logic. In: Ghilardi, S., Sebastiani, R. (eds.) FroCoS 2009. LNCS (LNAI), vol. 5749, pp. 263-278. Springer, Heidelberg (2009)
12. Gabbay, D.M., Ohlbach, H.J.: Quantifier elimination in second-order predicate logic. In: Nebel, B., Rich, C., Swartout, W. (eds.) Principles of Knowledge Representation and Reasoning. Morgan-Kaufmann, San Francisco (1992)
13. Ge, Y., Barrett, C., Tinelli, C.: Solving quantified verification conditions using satisfiability modulo theories. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 167-182. Springer, Heidelberg (2007)
14. Ghilardi, S.: Model theoretic methods in combined constraint satisfiability. Journal of Automated Reasoning 33(3-4), 221-249 (2005)
15. Ginsburg, S., Spanier, E.: Semigroups, Pressburger formulas and languages. Pacific Journal of Mathematics 16(2), 285-296 (1966)
16. Klaedtke, F., Rueß, H.: Parikh automata and monadic second-order logics with linear cardinality constraints. Technical Report 177, Institute of Computer Science at Freiburg University (2002)
17. Klaedtke, F., Rueß, H.: Monadic second-order logics with cardinalities. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719. Springer, Heidelberg (2003)
18. Klarlund, N., Møller, A.: MONA Version 1.4 User Manual. BRICS Notes Series NS-01-1, Department of Computer Science. University of Aarhus (January 2001)
19. Krstic, S., Goel, A., Grundy, J., Tinelli, C.: Combined satisfiability modulo parametric theories. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 602-617. Springer, Heidelberg (2007)
20. Kuncak, V., Nguyen, H.H., Rinard, M.: Deciding Boolean Algebra with Presburger Arithmetic. J. of Automated Reasoning (2006)
21. Kuncak, V., Rinard, M.: Towards efficient satisfiability checking for Boolean Algebra with Presburger Arithmetic. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 215-230. Springer, Heidelberg (2007)
22. Lahiri, S.K., Seshia, S.A.: The UCLID decision procedure. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 475-478. Springer, Heidelberg (2004)
23. McLaughlin, S., Barrett, C., Ge, Y.: Cooperating theorem provers: A case study combining HOL-Light and CVC Lite. In: PDPAR. ENTCS, vol. 144(2) (2006)
24. Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM TOPLAS 1(2), 245-257 (1979)
25. Owre, S., Rushby, J.M., Shankar, N.: PVS: A prototype verification system. In: Kapur, D. (ed.) 11th CADE, June 1992. LNCS (LNAI), vol. 607, pp. 748-752 (1992)
26. Parikh, R.J.: On context-free languages. J. ACM 13(4), 570-581 (1966)
27. Piskac, R., Kuncak, V.: Decision procedures for multisets with cardinality constraints. In: Logozzo, F., Peled, D.A., Zuck, L.D. (eds.) VMCAI 2008. LNCS, vol. 4905, pp. 218-232. Springer, Heidelberg (2008)
28. Piskac, R., Kuncak, V.: Linear arithmetic with stars. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 268-280. Springer, Heidelberg (2008)
29. Pratt-Hartmann, I.: Complexity of the two-variable fragment with counting quantifiers. Journal of Logic, Language and Information 14(3), 369-395 (2005)
30. Ramsey, F.P.: On a problem of formal logic. Proc. London Math. Soc. s2-30, 264-286 (1930), doi:10.1112/plms/s2-30.1.264
31. Thatcher, J.W., Wright, J.B.: Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory 2(1), 57-81 (1968)
32. Tinelli, C., Ringeissen, C.: Unions of non-disjoint theories and combinations of satisfiability procedures. Th. Comp. Sc. 290(1), 291-353 (2003)
33. Tinelli, C., Zarba, C.: Combining nonstably infinite theories. Journal of Automated Reasoning 34(3) (2005)
34. Wies, T.: Symbolic Shape Analysis. PhD thesis. University of Freiburg (2009)
35. Wies, T., Piskac, R., Kuncak, V.: On Combining Theories with Shared Set Operations. Technical Report LARA-REPORT-2009-002, EPFL (May 2009)
36. Zee, K., Kuncak, V., Rinard, M.: Full functional verification of linked data structures. In: ACM Conf. Programming Language Design and Implementation, PLDI (2008)