Ranking abstraction of recursive programs

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

Volumn 3855 LNCS, Issue , 2006, Pages 267-281

  Balaban, Ittai ^a   Cohen, Ariel ^a   Pnueli, Amir ^a,b  

^a POLYTECHNIC UNIVERSITY   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

FAIR DISCRETE SYSTEM (FDS); FINITARY STATE ABSTRACTION; PROCEDURAL PROGRAM; RECURSIVE PROGRAMS;

COMPUTER PROGRAM LISTINGS; FINITE AUTOMATA; MATHEMATICAL MODELS; RECURSIVE FUNCTIONS; SECURITY OF DATA; VIRTUAL REALITY;

ABSTRACTING;

EID: 33745650096     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (13)

1. [ABE+05] R. Alur, M. Benedikt, K. Etessami, P. Godefroid, T.W. Reps, and M. Yannakakis. Analysis of recursive state machines. ACM Trans. Program. Lang. Syst., 27(4):786-818, 2005.
2. [AEM04] R. Alur, K. Etessami, and P. Madhusudan. A temporal logic of nested calls and returns. In TACAS'04, pages 467-481.
3. [ACEM05] R. Alur, S. Chaudhuri, K. Etessami, and P. Madhusudan. On-the-fly reachability and cycle detection for recursive state machines. In TACAS'05, pages 61-765.
4. [AEY01] R. Alur, K. Etessami, and M. Yannakakis. Analysis of recursive state machines. In CAV'01, pages 207-220.
5. [BPZ05] I. Balaban, A. Pnueli, and L.D. Zuck. Shape analysis by predicate abstraction. In VMCAI'05, pages 164-180.
6. [BR00] T. Ball and S.K. Rajamani. Bebop: A symbolic model checker for boolean programs. In SPIN'00, pages 113-130.
7. [GS97] S. Graf and H. Saïdi. Construction of abstract state graphs with PVS. In CAV'97, pages 72-83.
8. [KP00] Y. Kesten and A. Pnueli. Verification by augmented finitary abstraction. Information and Computation, 163(1):203-243, 2000.
9. [KPR98] Y. Kesten, A. Pnueli, and L. Raviv. Algorithmic verification of linear temporal logic specifications, In CAV'98, pages 1-16.
10. [PSW05] A. Podelski, I. Schaefer, and S. Wagner. Summaries for while programs with recursion. In ESOP'05, pages 94-107.
11. [RQ05] J. Rehof and S. Qadeer, Context-bounded model checking of concurrent software. In TACAS'05, pages 93-107.
12. [Sha00] E. Shahar. The TLVManual, 2000. http://www.cs.nyu.edu/acsys/tlv.
13. [SP81] M. Sharir and A. Pnueli. Two approaches to inter-procedural data-flow analysis. In Jones and Muchnik, editors, Program Flow Analysis: Theory and Applications. Prentice-Hall, 1981.