A Logic-Based Framework for Reasoning about Composite Data Structures

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

Volumn 5710 LNCS, Issue , 2009, Pages 178-195

  Bouajjani, Ahmed ^a   Drǎgoi, Cezara ^a   Enea, Constantin ^a   Sighireanu, Mihaela ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX DATA STRUCTURES; DATA CONSTRAINTS; DATA DOMAINS; FIRST ORDER LOGIC; LINEAR CONSTRAINTS; LINKED STRUCTURES; LOGIC-BASED FRAMEWORKS; PARAMETERIZED; PROGRAM VERIFICATION; REACHABILITY; SATISFIABILITY PROBLEMS; UNIVERSAL QUANTIFIERS;

AUTOMATA THEORY; CRYSTAL LATTICES; DATA STRUCTURES;

COMPUTABILITY AND DECIDABILITY;

EID: 70349865199     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04081-8_13     Document Type: Conference Paper

References (18)

1. Balaban, I., Pnueli, A., Zuck, L.D.: Shape analysis of single-parent heaps. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol.4349, pp. 91-105. Springer, Heidelberg (2007)
2. Benedikt, M., Reps, T.W., Sagiv, S.: A decidable logic for describing linked data structures. In: Swierstra, S.D. (ed.) ESOP 1999. LNCS, vol.1576, pp. 2-19. Springer, Heidelberg (1999)
3. Berdine, J., Calcagno, C., Cook, B., Distefano, D., O'Hearn, P.W.,Wies, T., Yang, H.: Shape analysis for composite data structures. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol.4590, pp. 178-192. Springer, Heidelberg (2007)
4. Berdine, J., Calcagno, C., O'Hearn, P.W.: A decidable fragment of separation logic. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol.3328, pp. 97-109. Springer, Heidelberg (2004)
5. Blanco, V., Puerto, J.: Short rational generating functions for multiobjective linear integer programming. arXiv:0712.4295v3 (2008)
6. Borger, E., Gradel, E., Gurevich, Y.: The Classical Decision Problem. Perspectives of Mathematical Logic. Springer, Heidelberg (1997)
7. Bouajjani, A., Bozga, M., Habermehl, P., Iosif, R., Moro, P., Vojnar, T.: Programs with lists are counter automata. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.4144, pp. 517-531. Springer, Heidelberg (2006)
8. Bouajjani, A., Drcagoi, C., Enea, C., Sighireanu, M.: A logic-based framework for reasoning about composite data structures. Technical report. LIAFA, University Paris 7 & CNRS
9. Bouajjani, A., Habermehl, P., Jurski, Y., Sighireanu, M.: Rewriting systems with data. In: Csuhaj-Varju, E., Esik, Z. (eds.) FCT 2007. LNCS, vol.4639, pp. 1-22. Springer, Heidelberg (2007)
10. Bouajjani, A., Habermehl, P., Rogalewicz, A., Vojnar, T.: Abstract regular tree model checking of complex dynamic data structures. In: Yi, K. (ed.) SAS 2006. LNCS, vol.4134, pp. 52-70. Springer, Heidelberg (2006)
11. Bradley, A.R., Manna, Z., Sipma, H.B.: What's decidable about arrays? In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol.3855, pp. 427-442. Springer, Heidelberg (2005)
12. Ehrgott, M.: A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spectrum 22(4), 425-460 (2000)
13. Habermehl, P., Iosif, R., Vojnar, T.: What else is decidable about integer arrays? In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol.4962, pp. 474-489. Springer, Heidelberg (2008)
14. Lahiri, S.K., Qadeer, S.: Back to the future: revisiting precise program verification using SMT solvers. In: POPL, pp. 171-182. ACM, New York (2008)
15. Møller, A., Schwartzbach, M.I.: The pointer assertion logic engine. In: PLDI, pp. 221-231. ACM, New York (2001)
16. Reynolds, J.C.: Separation logic: A logic for shared mutable data structures. In: LICS, pp. 55-74. IEEE Computer Society, Los Alamitos (2002)
17. Sagiv, S., Reps, T.W.,Wilhelm, R.: Parametric shape analysis via 3-valued logic. ACMTrans. Program. Lang. Syst. 24(3), 217-298 (2002)
18. Yorsh, G., Rabinovich, A.M., Sagiv, M., Meyer, A., Bouajjani, A.: A logic of reachable patterns in linked data-structures. J. Log. Algebr. Program. 73(1-2), 111-142 (2007)