Automatic verification of parameterized data structures

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

Volumn 3920 LNCS, Issue , 2006, Pages 27-41

  Deshmukh, Jyotirmoy V ^a   Allen Emerson, E ^a   Gupta, Prateek ^a  

^a University of Texas at Austin   (United States)

Author keywords

Data structures; Parameterized correctness

Indexed keywords

COMPUTATION THEORY; COMPUTER SOFTWARE; GRAPH THEORY; ITERATIVE METHODS; POLYNOMIALS;

INPUT GRAPHS; OUTPUT GRAPHS; PARAMETERIZED CORRECTNESS; TEMPORAL LOGIC;

DATA STRUCTURES;

EID: 33745773436     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11691372_2     Document Type: Conference Paper

References (16)

1. [BRS '99] Michael Benedikt, Thomas W. Reps, Shmuel Sagiv, A Decidable Logic for Describing Linked Data Structures, In Proceedings of 8th European Symposium on Programming, 1999, (ESOP '99), pp. 2-19
2. [Bou et al.] A. Bouajjani, P. Habermehl, P. Moro, T. Vojnar, Verifying Programs with Dynamic 1-Selector-Linked Structures in Regular Model Checking, In Proceedings of 12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 2005, (TACAS'05), LNCS 3440, April 2005.
3. [Car '94] Olivier Carton, Chain Automata, In IFIP World Computer Congress 1994, Hamburg, pp. 451-458, Elsevier (North-Holland).
4. [EJ '88] E. Allen Emerson, Charanjit S. Jutla, The Complexity of Tree Automata and Logics of Programs, In Proceedings of 29th IEEE Foundations of Computer Science, 1988, (FOGS '88), pp. 328-337.
5. [EK '02] E. Allen Emerson, Vineet Kahlon, Model Checking Large-Scale and Parameterized Resource Allocation Systems, In Proceedings of Tools and Algorithms for the Construction and Analysis of Systems, 8th International Conference, 2002, (TACAS '02), pp. 251-265
6. [EJ '91] E. A. Emerson and C. S. Jutla, Tree Automata, Mu-Calculus and Determinacy, (Extended Abstract), In Proceedings of Foundations of Computer Science 1991, (FOGS '91), pp. 368-377.
7. [Em '85] E. Allen Emerson. Automata, Tableaux, and Temporal Logics, Conference on Logics of Programs, New York, NY. LNCS 193, pp. 79-88
8. [HU '79] John E. Hopcroft and Jeffrey D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison Wesley, (1979).
9. [Lev-Ami et al.] Tal Lev-Ami, Thomas W. Reps, Shmuel Sagiv, Reinhard Wilhelm, Putting static analysis to work for verification: A case study In International Symposium on Software Testing and Analysis, 2000, (ISSTA'00), pp. 26-38
10. [MS '01] Andres Møller, Michael I. Schwartzbach, The Pointer Assertion Logic Engine, In Proceedings of SIGPLAN Conference on Programming Languages Design and Implementation, 2001, (PLDI '01), pp. 221-231.
11. [NSV '04] Frank Neven, Thomas Schwentick, Victor Vianu, Finite state machines for strings over infinite alphabets, In ACM Transactions on Computational Logic, (TOCL), Volume 15 Number 3, pp. 403-435, July 2004.
12. [ORY '01] Peter O'Hearn, John Reynolds, Hongseok Yang, Local Reasoning about Programs that Alter Data Structures, Invited Paper, In Proceedings of 15th Annual Conference of the European Association for Computer Science Logic, 2001, (CSL '01), pp. 1-19.
13. [Rey '02] John C. Reynolds, Separation Logic: A Logic for Shared Mutable Data Structures, In Proceedings of the 17th IEEE Symposium on Logic in Computer Science, 2002, (LICS 2002), pp. 55-74.
14. [Rose '65] Arnold L. Rosenberg, On multi-head finite automata, FOCS 1965, pp.221-228
15. [Sch '02] Ph. Schnoebelen, The complexity of temporal logic model checking, In Advances in Modal Logic, papers from 4th International Workshop on Advances in Modal Logic 2002, (AiML'02), Sep.-Oct. 2002, Toulouse, France.
16. [SRW '99] M. Sagiv, T. Reps, and R. Wilhelm, Parametric shape analysis via 3-valued logic, In Symposium on Principles of Programming Languages, 1999, (POPL '99).