Transition invariants

Proceedings - Symposium on Logic in Computer Science

Volumn 19, Issue , 2004, Pages 32-41

  Podelski, Andreas ^a   Rybalchenko, Andrey ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; COMPUTER SCIENCE; ENCODING (SYMBOLS); FUNCTION EVALUATION; SET THEORY; UTILITY PROGRAMS;

CONCURRENT PROGRAMS; TEMPORAL VERIFICATIONS; TRANSITION INVARIANTS;

COMPUTER PROGRAMMING;

EID: 4544225317     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/lics.2004.1319598     Document Type: Conference Paper

References (24)

1. T. Ball, R. Majumdar, T. Millstein, and S. Rajamani. Automatic predicate abstraction of C programs. In Proc. of PLDI'2001: Programming Language Design and Implementation, volume 36 of ACM SIGPLAN Notices, pages 203-213. ACM Press, 2001.
2. B. Blanchet, P. Cousot, R. Cousot, J. Feret, L. Mauborgne, A. Miné, D. Monniaux, and X. Rival. A static analyzer for large safety-critical software. In Proc. of PLDI'2003: Programming Language Design and Implementation, pages 196-207. ACM Press, June 7-14 2003.
3. S. Chaki, E. Clarke, A. Grace, S. Jha, and H. Veith, Modular verification of software components in C. In Proc. of ICSE'2003: Int. Conf. on Software Engineering, pages 385-395, 2003.
4. 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'1977: Principles of Programming Languages, pages 238-252. ACM Press, 1977.
5. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Proc. of POPL'1979: Principles of Programming Languages, pages 269-282. ACM Press, 1979.
6. Y. Fang, N. Piterman, A. Pnueli, and L. D. Zuck. Liveness with invisible ranking. In Steffen and Levi [20], pages 223-238.
7. S. Graf and H. Saïdi. Construction of abstract state graphs with PVS. In Proc. of CAV'1997: Computer Aided Verification, volume 1254 of LNCS, pages 72-83. Springer, 1997.
8. T. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy Abstraction. In Proc. of POPL'2002: Principles of Programming Languages, pages 58-70. ACM Press, 2002.
9. N. Klarlund. Progress measures and stack assertions for fair termination. In Proc. of PODC'1992: Principles of Distributed Computing, pages 229-240. ACM Press, 1992.
10. C. S. Lee, N. D. Jones, and A. M. Ben-Amram. The size-change principle for program termination. In Proc. of POPL'2001: Principles of Programming Languages, volume 36, 3 of ACM SIGPLAN Notices, pages 81-92. ACM Press, 2001.
11. D. Lehmann, A. Pnueli, and J. Stavi. Impartiality, justice and fairness: The ethics of concurrent termination. In Proc. of ICALP'1981: Int. Colloq. onAutomata, Languages and Programming, volume 115 of LNCS, pages 264-277. Springer, 1981.
12. Z. Manna and A. Pnueli. Axiomatic approach to total correctness of programs. Acta Informatica, (3):243-263, 1974.
13. Z. Manna and A. Pnueli. Completing the temporal picture. Theoretical Computer Science, 83(1):91-130, 1991.
14. Z. Manna and A. Pnueli. Temporal verification of reactive systems: Safety. Springer, 1995.
15. Z. Manna and A. Pnueli. Temporal verification of reactive systems: Progress. Draft, 1996.
16. A. Podelski and A. Rybalchenko. Transition predicate abstraction. Draft. Available from the authors.
17. A. Podelski and A. Rybalchenko. A complete method for the synthesis of linear ranking functions. In Steffen and Levi [20], pages 239-251.
18. F. P. Ramsey. On a problem of formal logic. In Proc. London Math. Soc., volume 30, pages 264-285, 1930.
19. P. A. Sistla, M. Y. Vardi, and P. Wolper. The complementation problem for Büchi automata with applications to temporal logic. Theoretical Computer Science, 49(2-3):217-237, 1987.
20. B. Steffen and G. Levi, editors. Proc. of VMCAI'2004: Verification, Model Checking, and Abstract Interpretation, volume 2937 of LNCS. Springer, 2004.
21. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics, pages 133-192. Elsevier and MIT Press, 1990.
22. A. Tiwari. Termination of linear programs. In Proc. of CAV'2004: Computer Aided Verification, 2004. To appear.
23. M. Y. Vardi. Verification of concurrent programs - the automata-theoretic framework. Annals of Pure and Applied Logic, 51:79-98, 1991.
24. M. Y. Vardi. Rank predicates vs. progress measures in concurrent-program verification. Chicago Journal of Theoretical Computer Science, 1996.