Sets with cardinality constraints in satisfiability modulo theories

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

Volumn 6538 LNCS, Issue , 2011, Pages 403-418

  Suter, Philippe ^a   Steiger, Robin ^a   Kuncak, Viktor ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED APPROACH; BELONG TO; CARDINALITIES; CARDINALITY CONSTRAINTS; COMPLEX PROPERTIES; DECISION PROCEDURE; EFFICIENT IMPLEMENTATION; EXPONENTIAL EXPLOSION; FIRST ORDER LOGIC; FUNCTIONAL PROGRAMS; LINEAR ARITHMETIC; NP COMPLETE PROBLEMS; PLUG-INS; PRESBURGER ARITHMETIC; SATISFIABILITY MODULO THEORIES; SET VARIABLES;

ABSTRACTING; ALGORITHMS; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; MODEL CHECKING;

BOOLEAN ALGEBRA;

EID: 79251587744     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-18275-4_28     Document Type: Conference Paper

References (21)

1. Beyer, D., Henzinger, T.A., Jhala, R., Majumdar, R.: The software model checker Blast. STTT 9(5-6), 505-525 (2007)
2. Dewar, R.K.: Programming by refinement, as exemplified by the SETL representation sublanguage. ACM TOPLAS (July 1979)
3. Feferman, S., Vaught, R.L.: The first order properties of products of algebraic systems. Fundamenta Mathematicae 47, 57-103 (1959)
4. Gottlob, G., Greco, G., Marnette, B.: HyperConsistency width for constraint satisfaction: Algorithms and complexity results. In: Lipshteyn, M., Levit, V.E., Mc-Connell, R.M. (eds.) Graph Theory, Computational Intelligence and Thought. LNCS, vol. 5420, pp. 87-99. Springer, Heidelberg (2009)
5. Gulwani, S., Lev-Ami, T., Sagiv, M.: A combination framework for tracking partition sizes. In: POPL, pp. 239-251 (2009)
6. Krstić, 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) (Pubitemid 350259324)
7. Kuncak, V.: Modular Data Structure Verification. Ph.D. thesis, EECS Department, Massachusetts Institute of Technology (February 2007)
8. Kuncak, V., Nguyen, H.H., Rinard, M.: Deciding Boolean Algebra with Presburger Arithmetic. J. of Automated Reasoning (2006) (Pubitemid 44954250)
9. Kuncak, V., Piskac, R., Suter, P., Wies, T.: Building a calculus of data structures. In: Barthe, G., Hermenegildo, M. (eds.) VMCAI 2010. LNCS, vol. 5944, pp. 26-44. Springer, Heidelberg (2010)
10. 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)
11. Lam, P., Kuncak, V., Rinard, M.: Generalized typestate checking for data structure consistency. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 430-447. Springer, Heidelberg (2005)
12. Liang, S.: The Java Native Interface: Programmer's Guide and Specification. Addison-Wesley, Reading (1999)
13. de Moura, L., Bjørner, N.: Model-based theory combination. Electronic Notes in Theoretical Computer Science 198(2), 37-49 (2008)
14. 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)
15. Pérez, J.A.N., Rybalchenko, A., Singh, A.: Cardinality abstraction for declarative networking applications. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 584-598. Springer, Heidelberg (2009)
16. Suter, P., Dotta, M., Kuncak, V.: Decision procedures for algebraic data types with abstractions. In: POPL (2010)
17. Wies, T., Piskac, R., Kuncak, V.: Combining theories with shared set operations. In: Ghilardi, S., Sebastiani, R. (eds.) FroCoS 2009. LNCS, vol. 5749, pp. 366-382. Springer, Heidelberg (2009)
18. Yessenov, K., Kuncak, V., Piskac, R.: Collections, cardinalities, and relations. In: Barthe, G., Hermenegildo, M. (eds.) VMCAI 2010. LNCS, vol. 5944, pp. 380-395. Springer, Heidelberg (2010)
19. Zarba, C.G.: Combining sets with integers. In: Armando, A. (ed.) FroCos 2002. LNCS (LNAI), vol. 2309, pp. 103-116. Springer, Heidelberg (2002)
20. Zee, K., Kuncak, V., Rinard, M.: Full functional verification of linked data structures. In: PLDI, pp. 349-361 (2008)
21. Zee, K., Kuncak, V., Rinard, M.: An integrated proof language for imperative programs. In: PLDI, pp. 338-351 (2009)