Terminator: Beyond safety

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

Volumn 4144 LNCS, Issue , 2006, Pages 415-418

  Cook, Byron ^a   Podelski, Andreas ^b,c   Rybalchenko, Andrey ^b,d  

^a MICROSOFT RESEARCH   (United States)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c UNIVERSITY OF FREIBURG   (Germany)

^d EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTER PROGRAMMING; ITERATIVE METHODS; SECURITY OF DATA;

DEVICE DRIVER DISPATCH ROUTINES; MODEL CHECKERS; PROGRAM ANALYSIS TOOLS; SYMBOLIC SOFTWARE MODEL CHECKERS;

COMPUTER SOFTWARE;

EID: 33749830015     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11817963_37     Document Type: Conference Paper

References (18)

1. T. Ball, E. Bounimova, B. Cook, V. Levin, J. Lichtenberg, C. McGarvey, B. Ondrusek, S. K. Rajamani, and A. Ustuner. Thorough static analysis of device drivers. In EuroSya'06: European Systems Conference, pages 73-85, 2006.
2. A. Bradley, Z. Manna, and H. Sipma. Termination of polynomial programs. In VMCAI'05: Verification, Model Checking, and Abstract Interpretation, volume 3385 of LNCS, pages 113-129. Springer, 2005.
3. S. Chaki, E. Clarke, A. Groce, S. Jha, and H. Veith. Modular verification of software components in C. In ICSE'03: International Conference on Software Engineering, pages 385-395. IEEE, 2003.
4. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In CAV'00: Computer Aided Verification, volume 1855 of LNCS, pages 154-169. Springer, 2000.
5. M. Codish and C. Taboch. A semantic basis for the termination analysis of logic programs. The Journal of Logic Programming, 41(1):103-123, 1999.
6. M. Colón and H. Sipma. Practical methods for proving program termination. In CAV'02: Computer Aided Verification, volume 2404 of LNCS, pages 442-454. Springer, 2002.
7. B. Cook, A. Podelski, and A. Rybalchenko. Abstraction refinement for termination. In SAS'05: Static Analysis Symposium, volume 3672 of LNCS, pages 87-101. Springer, 2005.
8. B. Cook, A. Podelski, and A. Rybalchenko. Termination proofs for systems code. In PLDI'06: Programming Language Design and Implementation (to appear), 2006.
9. P. Cousot. Proving program invariance and termination by parametric abstraction, lagrangian relaxation and semidefinite programming. In VMCAI'05: Verification, Model Checking, and Abstract Interpretation, volume 3385 of LNCS, pages 1-24. Springer, 2005.
10. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In POPL'79: Principles of Programming Languages, pages 269-282. ACM Press, 1979.
11. J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke. Automated termination proofs with AProVE. In RTA'04'- Rewriting Techniques and Applications, volume 3091 of LNCS, pages 210-220. Springer, 2004.
12. T. A. Henzinger, R. Jhala, R. Majumdar, and K. L. McMillan. Abstractions from proofs. In POPL'04: Principles of Programming Languages, pages 232-244. ACM Press, 2004.
13. C. S. Lee, N. D. Jones, and A. M. Ben-Amram. The size-change principle for program termination. In POPL'01: Principles of Programming Languages, volume 36, 3 of ACM SIGPLAN Notices, pages 81-92. ACM Press, 2001.
14. N. Lindenstrauss, Y. Sagiv, and A. Serebrenik. TermiLog: A system for checking termination of queries to logic programs. In CA V'97: Computer-Aided Verification, LNCS, pages 444-447. Springer, 1997.
15. Microsoft Corporation. Windows Static Driver Verifier. Available at www.microsoft.com/whdc/devtools/tools/SDV.mspx, July 2004.
16. A. Podelski and A. Rybalchenko. A complete method for the synthesis of linear ranking functions. In VMCAI'04: Verification, Model Checking, and Abstract Interpretation, pages 239-251, 2004.
17. A. Podelski and A. Rybalchenko. Transition invariants. In LICS'04: Logic in Computer Science, pages 32-41. IEEE, 2004.
18. A. Podelski and A. Rybalchenko. Transition predicate abstraction and fair termination. In POPL'05: Principles of Programming Languages, pages 132-144. ACM Press, 2005.