Building a calculus of data structures

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

Volumn 5944 LNCS, Issue , 2010, Pages 26-44

  Kuncak, Viktor ^a   Piskac, Ruzica ^a   Suter, Philippe ^a   Wies, Thomas ^b  

^a EPFL   (Switzerland)

^b INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC DATA-TYPES; ALL-REDUCE; DECISION PROCEDURE; FIRST ORDER LOGIC; MANY-TO-ONE; MONADIC SECOND-ORDER LOGIC; MULTI-SETS; MULTIPLE DATA; MULTISET; NUMERICAL QUANTITY; PREDICATE ABSTRACTIONS; PRESBURGER ARITHMETIC; RAMSEY CLASS; SATISFIABILITY; SOFTWARE VERIFICATION; STRUCTURE THEORY; SUBFORMULAS; TRUTH VALUES; TYPE SYSTEMS; VERIFICATION CONDITION;

ABSTRACTING; BOOLEAN ALGEBRA; CALCULATIONS; DATA STRUCTURES; MODEL CHECKING; PROGRAM INTERPRETERS;

COMPUTABILITY AND DECIDABILITY;

EID: 77949443933     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11319-2_6     Document Type: Conference Paper

References (33)

1. [BGG97] Börger, E., Grädel, E., Gurevich, Y.: The Classical Decision Problem. Springer, Heidelberg (1997)
2. [BM07] Bradley, A.R., Manna, Z.: The Calculus of Computation. Springer, Heidelberg (2007)
3. [BST07] Barrett, C., Shikanian, I., Tinelli, C.: An abstract decision procedure for satisfiability in the theory of recursive data types. Electronic Notes in Theoretical Computer Science 174(8), 23-37 (2007)
4. [BT07] Barrett, C., Tinelli, C.: CVC3. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 298-302. Springer, Heidelberg (2007)
5. [CD94] Comon, H., Delor, C.: Equational formulae with membership constraints. Information and Computation 112(2), 167-216 (1994)
6. [dMB08] de Moura, L., Bjørner, N.S.: Z3: An efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337-340. Springer, Heidelberg (2008)
7. [dMB09] de Moura, L., Bjørner, N.: Generalized, efficient array decision procedures. In: FMCAD (2009)
8. [ES06] Eisenbrand, F., Shmonin, G.: Carathéodory bounds for integer cones. Operations Research Letters 34(5), 564-568 (2006)
9. [GBT07] 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)
10. +04] Ganzinger, H., Hagen, G., Nieuwenhuis, R., Oliveras, A., Tinelli, C.: DPLL(T): Fast decision procedures. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 175-188. Springer, Heidelberg (2004)
11. [GS66] Ginsburg, S., Spanier, E.: Semigroups, Presburger formulas and languages. Pacific Journal of Mathematics 16(2), 285-296 (1966)
12. [KNR06] Kuncak, V., Nguyen, H.H., Rinard, M.: Deciding Boolean Algebra with Presburger Arithmetic. J. of Automated Reasoning (2006)
13. [KR07] 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)
14. [LS04] 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)
15. [NO79] Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM TOPLAS 1(2), 245-257 (1979)
16. [Opp78] Oppen, D.C.: Reasoning about recursively defined data structures. In: POPL, pp. 151-157 (1978)
17. [OSV08] Odersky, M., Spoon, L., Venners, B.: Programming in Scala: a comprehensive step-by-step guide. Artima Press (2008)
18. [Pap81] Papadimitriou, C.H.: On the complexity of integer programming. J. ACM 28(4), 765-768 (1981)
19. [PH05] Pratt-Hartmann, I.: Complexity of the two-variable fragment with counting quantifiers. Journal of Logic, Language and Information 14(3), 369-395 (2005)
20. [PK08a] 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)
21. [PK08b] Piskac, R., Kuncak, V.: Fractional collections with cardinality bounds. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol. 5213, pp. 124-138. Springer, Heidelberg (2008)
22. [PK08c] 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)
23. [Pot91] Pottier, L.: Minimal solutions of linear diophantine systems: Bounds and algorithms. In: Book, R.V. (ed.) RTA 1991. LNCS, vol. 488. Springer, Heidelberg (1991)
24. [Pre29] Presburger, M.: Über die Vollständigkeit eines gewissen Systems der Aritmethik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In: Comptes Rendus du premier Congrès des Mathématiciens des Pays slaves, Warsawa, pp. 92-101 (1929)
25. [PST00] Pacholski, L., Szwast, W., Tendera, L.: Complexity results for first-order two-variable logic with counting. SIAM J. on Computing 29(4), 1083-1117 (2000)
26. [Ram30] Ramsey, F.P.: On a problem of formal logic. Proc. London Math. Soc., s2-30, 264-286 (1930)
27. [SBDL01] Stump, A., Barrett, C.W., Dill, D.L., Levitt, J.R.: A decision procedure for an extensional theory of arrays. In: LICS, pp. 29-37 (2001)
28. [SDK10] Suter, P., Dotta, M., Kuncak, V.: Decision procedures for algebraic data types with abstractions. In: POPL (2010)
29. [Sko19] Skolem, T.: Untersuchungen über die Axiome des Klassenkalküls und über Produktations- und Summationsprobleme, welche gewisse Klassen von Aussagen betreffen. Skrifter utgit av Vidnskapsselskapet i Kristiania, I. klasse, no. 3, Oslo (1919)
30. [TW68] 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)
31. [Wie09] Wies, T.: Symbolic Shape Analysis. PhD thesis, University of Freiburg (2009)
32. [WPK09] Wies, T., Piskac, R., Kuncak, V.: Combining theories with shared set operations. In: FroCoS: Frontiers in Combining Systems (2009)
33. [ZKR08] Zee, K., Kuncak, V., Rinard, M.: Full functional verification of linked data structures. In: PLDI (2008)