Verifying programs with dynamic 1-selector-linked structures in regular model checking

Lecture Notes in Computer Science

Volumn 3440, Issue , 2005, Pages 13-29

  Bouajjani, Ahmed ^a   Habermehl, Peter ^a   Moro, Pierre ^a   Vojnar, Tomáš ^b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b BRNO UNIVERSITY OF TECHNOLOGY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; DATA STRUCTURES; ENCODING (SYMBOLS); FINITE AUTOMATA; PROBLEM SOLVING; SET THEORY; TRANSDUCERS;

AUTOMATIC VERIFICATION; FINITE STATE TRANSDUCERS; MODEL CHECKING; SYMBOLIC VERIFICATION;

COMPUTER PROGRAM LISTINGS;

EID: 24644492502     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31980-1_2     Document Type: Conference Paper

References (20)

1. P.A. Abdulla, J. d'Orso, B. Jonsson, and M. Nilsson. Algorithmic Improvements in Regular Model Checking. In Proc. of CAV'03, volume 2725 of LNCS. Springer, 2003.
2. A. Bouajjani, P. Habermehl, and T. Vojnar. Abstract Regular Model Checking. In Proc. of CAV'04, volume 3114 of LNCS. Springer, 2004.
3. A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili. Regular Model Checking. In Proc. of CAV'00, volume 1855 of LNCS. Springer, 2000.
4. M. Bozga, R. Iosif, and Y. Lakhnech. Storeless Semantics and Alias Logic. In Proc. of PEPM'03. ACM Press, 2003.
5. A. Deutsch. Interprocedural May-Alias Analysis for Pointers: Beyond k-Limiting. In Proc. of PLDI'94. ACM Press, 1994.
6. P. Habermehl and T. Vojnar. Regular Model Checking Using Inference of Regular Languages. In Proc. of the 6th Infinity Workshop, 2004.
7. N. Immerman, A. Rabinovich, T. Reps, M. Sagiv, and G. Yorsh. Verification via Structure Simulation. In Proc. of CAV'04, volume 3114 of LNCS. Springer, 2004.
8. J.L. Jensen, M.E. Jørgensen, N. Klarlund, and M.I. Schwartzbach. Automatic Verification of Pointer Programs Using Monadic Second-order Logic. In Proc. of PLDI '97, 1997.
9. H.B.M. Jonkers. Abstract Storage Structures. In Algorithmic Languages. IFIP, 1981.
10. B. Jonsson and M. Nilsson. Transitive Closures of Regular Relations for Verifying Infinite-State Systems. In Proc. of TACAS'00, volume 1785 of LNCS. Springer, 2000.
11. Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic Model Checking with Rich Assertional Languages. Theoretical Computer Science, 256(1-2), 2001.
12. N. Klarlund and A. Møller. MONA Version 1.4 User Manual. BRIGS, Department of Computer Science, University of Aarhus, Denmark, 2001.
13. A. Loginov, T. Reps, and M. Sagiv. Abstraction Refinement for 3-Valued-Logic Analysis. Technical Report 1504, Computer Science Dept., University of Wisconsin, USA, 2004.
14. R. Manevich, E. Yahav, G. Ramalingam, and M. Sagiv. Predicate Abstraction and Canonical Abstraction for Singly-Linked Lists. In Proc. of VMCAI'05. Springer, 2005.
15. A. Møller and M.I. Schwartzbach. The Pointer Assertion Logic Engine. In Proc. of PLDI '01, 2001.
16. Also in SIGPLAN Notices 36(5) (May 2001).
17. S. Sagiv, T.W. Reps, and R. Wilhelm. Parametric Shape Analysis via 3-Valued Logic. TOPLAS, 24(3), 2002.
18. T. Touili. Widening Techniques for Regular Model Checking. ENTCS, 50, 2001.
19. A. Venet. Automatic Analysis of Pointer Aliasing for Untyped Programs. Science of Computer Programming, 35(2), 1999.
20. P. Wolper and B. Boigelot. Verifying Systems with Infinite but Regular State Spaces. In Proc. of CAV'98, volume 1427, 1998.