Programs with lists are counter automata

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

Volumn 4144 LNCS, Issue , 2006, Pages 517-531

  Bouajjani, Ahmed ^b   Bozga, Marius ^a   Habermehl, Peter ^b   Iosif, Radu ^a   Moro, Pierre ^b   Vojnar, Tomáš ^c  

^a VERIMAG   (France)

^b UNIVERSITÉ PARIS DIDEROT   (France)

^c BRNO UNIVERSITY OF TECHNOLOGY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; DATA STRUCTURES; FINITE AUTOMATA; GRAPH THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; SECURITY OF DATA;

ABSTRACT HEAP GRAPHS; ACCURATE ABSTRACT MODELS; COUNTER AUTOMATA; VERIFICATION PROBLEM;

COMPUTER PROGRAMMING;

EID: 33749842015     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11817963_47     Document Type: Conference Paper

References (22)

1. The LASH toolset. http://www.montefiore.ulg.ac.be/~boigelot/research/ Iash/.
2. A. Bouajjani A. Annichini and M.Sighireanu. TReX: A Tool for Reachability Analysis of Complex Systems. In Proc. of CAV'01, volume 2102 of LNCS, 2001.
3. I. Balaban, A. Pnueli, and L. Zuck. Shape Analysis by Predicate Abstraction. In Proc. of VMCAI'05, volume 3385 of LNCS, 2005.
4. S. Bardin, A.Finkel, and D. Nowak. Toward Symbolic Verification of Programs Handling Pointers. In Proc. of AVIS'04, 2004.
5. S. Bardin, A. Finkel, J. Leroux, and L. Petrucci. FAST: Fast Acceleration of Symbolic Transition systems. In Proc. of CAV'03, volume 2725 of LNCS, 2003.
6. J. Berdine, C. Calcagno, and P. O'Hearn. A Decidable Fragment of Separation Logic. In Proc. of FSTTCS'04, volume 3328 of LNCS, 2004.
7. A. Bouajjani, M. Bozga, P. Habermehl, R. Iosif, P. Moro, and T. Vojnar. Programs with Lists are Counter Automata. Tech. Rep. TR-2006-3, Verimag, UJF/CNRS/INPG, Grenoble, 2006.
8. A. Bouajjani, P. Habermehl, P. Moro, and T. Vojnar. Verifying Programs with Dynamic I-Selector-Linked Structures in Regular Model Checking. In Proc, of TACAS'05, volume 3440 of LNCS, 2005.
9. A. Bouajjani, P. Habermehl, and T. Vojnar. Abstract Regular Model Checking. In Proc. of CAV'04, volume 3114 of LNCS, 2004.
10. M. Bozga and R. Iosif. Quantitative Verification of Programs with Lists. VERIMAG TR-2005-2, http://www-verimag.imag.fr, 2005.
11. A. Bradley, Z. Manna, and H. Sipma. Termination Analysis of Integer Linear Loops. In Proc. of CONCUR'05, volume 3653 of LNCS, 2005.
12. B. Cook, A. Podelski, and A. Rybalchenko. Abstraction Refinement for Termination. In Proc. of SAS'05, volume 3672 of LNCS, 2005.
13. P. Cousot and R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In Proc. of POPL'97, 1977.
14. N. Dor, M. Rodeh, and S. Sagiv. Checking Cleanness in Linked Lists. In Proc. of SAS'00, volume 1824 of LNCS, 2000.
15. A. Finkel, 2006. Personal communication.
16. R. Iosif. Symmetry Reductions for Model Checking of Concurrent Dynamic Software. STTT, pages 302-319, 2004.
17. S. Ishtiaq and P. O'Hearn. BI as an assertion language for mutable data structures. In Proc. of POPL'01, 2001.
18. R. Manevich, E. Yahav, G. Ramalingam, and M. Sagiv. Predicate Abstraction and Canonical Abstraction for Singly-Linked Lists. In Proc. of VMCAI'05, volume 3385 of LNCS, 2005.
19. A. Møller and M.I. Schwartzbach. The Pointer Assertion Logic Engine. In Proc. of PLDI'01. ACM Press, 2001.
20. M. Presburger. Über die Vollstandigkeit eines Gewissen Systems der Arithmetik. Comptes Rendus du I Congrés des Pays Slaves, 1929.
21. S. Sagiv, T.W. Reps, and R. Wilhelm. Parametric Shape Analysis via 3-Valued Logic. TOPLAS, 2002.
22. E. Yahav, T. Reps, M. Sagiv, and R. Wilhelm. Verifying Temporal Heap Properties Specified via Evolution Logic. In Proc. of ESOP'03, volume 2618 of LNCS, 2003.