Summaries for while programs with recursion

Lecture Notes in Computer Science

Volumn 3444, Issue , 2005, Pages 94-107

  Podelski, Andreas ^a   Schaefer, Ina ^a   Wagner, Silke ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ALGORITHMS; COMPUTATIONAL METHODS;

LIVENESS PROPERTIES; RECURSION; SUMMARY COMPUTATION;

COMPUTER PROGRAMMING;

EID: 24644491458     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31987-0_8     Document Type: Conference Paper

References (23)

1. R. Alur, K. Etessami, and P. Madhusudan. A temporal logic of nested calls and returns. In Proceedings of TACAS'04, 2004.
2. R. Alur, K. Etessami, and M. Yannakakis. Analysis of recursive state machines. In Proceedings of C4V'00, 2000.
3. T. Ball, R. Majumdar, T. Millstein, and S. Rajamani. Automatic predicate abstraction of C programs. In Proceedings of PLDI'2001, 2001.
4. T. Ball and S. Rajamani. Bebop: A symbolic model checker for boolean programs. In SPIN Workshop on Model Checking of Software, 2000.
5. M. Benedikt, P. Godefroid, and T. Reps. Model checking of unrestrcited hierachical state machines. In Proceedings of ICALP 2001, 2001.
6. A. Bouajjani, J. Esparza, and T. Touili. A generic approach to the static analysis of concurrent programs with procedures. In Proceedings of POPL'03.
7. M. Colón and H. Sipma. Synthesis of linear ranking functions. In Proceedings of TACAS'01, 2001.
8. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of POPL'77, 1977.
9. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Proceedings of POPL'1979, 1979.
10. C. Fanagan and S. Qadeer. Thread-modular model checking. In SPIN03: SPIN Workshop. Spiegel-Verlag, 2003.
11. B. Jeannet, A. Loginov, T. Reps, and M. Sagiv. A relational approach to interprocedural shape analysis. In In Proceedings of SAS'04, 2004.
12. D. A. McAllester and K. Arkoudas. Walther recursion. In CADE'96, 1996.
13. A. Podelski and A. Rybalchenko. A complete method for the synthesis of linear ranking functions. In Proceedings of VMCAI'04, 2004.
14. A. Podelski and A. Rybalchenko. Transition invariants. In Proceedings of LICS'04, 2004.
15. A. Podelski and A. Rybalchenko. Transition predicate abstraction and fair termination. In Proceedings of POPL'05, 2005.
16. A. Podelski, I. Schaefer, and S. Wagner. Summaries for While Programs with Recursion. Technical Report MPI-I-2004-1-007, Max-Planck-Institut für Informatik, Saarbrücken, Germany, 2004.
17. S. Qadeer, S.Rajamani, and J. Rehof. Summarizing procedures in concurrent programs. In Proceedings of POPL'04, 2004.
18. F. P. Ramsey. On a problem of formal logic. In Proceedings London Math. Soc., 1930.
19. T. Reps, M. Sagiv, and S. Horwitz. Precise interprocedural dataflow analysis via graph reachability. Proceedings of POPL'95, 1995.
20. T.W. Reps, S. Schwoon, and S. Jha. Weighted pushdown systems and their application to interprocedural dataflow analysis. Proceedings of SAS'03, 2003.
21. M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. Program Flow Analysis: Theory and Applications, 1981.
22. A. Tiwari. Termination of linear programs. In Proceedings of CAV'04, 2004.
23. M. Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proceedings of LICS'86, 1986.