Proving thread termination

ACM SIGPLAN Notices

Volumn 42, Issue 6, 2007, Pages 320-330

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

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITY OF FREIBURG   (Germany)

^c EPFL and MPI   (Germany)

Author keywords

Concurrency; Formal verification; Model checking; Program verification; Termination; Threads

Indexed keywords

FORMAL VERIFICATION;

AUTOMATIC PROGRAMS; CONCURRENCY; CONCURRENT PROGRAM; ENVIRONMENT MODELS; PRACTICAL METHOD; PROGRAM VERIFICATION; TERMINATION; THREADS;

MODEL CHECKING;

EID: 67650033384     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1273442.1250771     Document Type: Article

References (40)

1. B. Alpern and F. Schneider. Defining liveness. Information processing letters, 21:181-185, 1985.
2. I. Balaban, A. Cohen, and A. Pnueli. Ranking abstraction of recursive programs. In VMCAI'06: Verification, Model Checking, and Abstract Interpretation, 2006.
3. T. Ball et al. Thorough static analysis of device drivers. In EuroSys'06: European Systems Conference, 2006.
4. J. Berdine, A. Chawdhary, B. Cook, D. Distefano, and P. O'Hearn. Variance analyses from invariance analyses. In POPL'07: Principles of Programming Languages, 2007.
5. J. Berdine, B. Cook, D. Distefano, and P. O'Hearn. Automatic termination proofs for programs with shape-shifting heaps. In CAV'06: International Conference on Computer Aided Verification, 2006.
6. A. Biere, C. Artho, and V. Schuppan. Liveness checking as safety checking. In FMICS'02: Formal Methods for Industrial Critical Systems, 2002.
7. 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 PLDI'03: Programming Language Design and Implementation, 2003.
8. A. Bouajjani, M. Bozga, P. Habermehl, R. Iosif, P. Moro, and T. Vojnar. Programs with lists are counter automata. In CAV'06: International Conference on Computer Aided Verification, 2006.
9. A. Bradley, Z. Manna, and H. Sipma. Linear ranking with reachability. In CAV'05: Computer-Aided Verification, 2005.
10. A. Bradley, Z. Manna, and H. Sipma. The polyranking principle. In ICALP'05: International Colloquium on Automata, Languages and Programming, 2005. 329
11. A. Bradley, Z. Manna, and H. Sipma. Termination analysis of integer linear loops. In CONCUR'05: Concurrency Theory, 2005.
12. A. Bradley, Z. Manna, and H. Sipma. Termination of polynomial programs. In VMCAI'05: Verification, Model Checking, and Abstract Interpretation, 2005.
13. S. Chaki, E. M. Clarke, J. Ouaknine, N. Sharygia, and N. Sinha. Efficient verification of sequential and concurrent C programs. Formal Methods in System Design, 25(2-3):129-166, 2004.
14. E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 2000.
15. E. M. Clarke, M. Talupur, and H. Veith. Environment abstraction for parameterized verification. In VMCAI'06: Verification, Model Checking, and Abstract Interpretation, 2006.
16. J. M. Cobleigh, D. Giannakopoulou, and C. S. Pasareanu. Learning assumptions for compositional verification. In TACAS'04: Tools and Algorithms for the Construction and Analysis of Systems, 2003.
17. 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.
18. M. Colón and H. Sipma. Practical methods for proving program termination. In CAV'02: Computer Aided Verification, 2002.
19. E. Contejean, C. Marché, B. Monate, and X. Urbain. Proving Termination of Rewriting with Ci ME. In WST'03: International Workshop on Termination, 2003.
20. B. Cook, A. Gotsman, A. Podelski, A. Rybalchenko, and M. Vardi. Proving that software eventually does something good. In POPL'07: Principles of Programming Languages, 2007.
21. B. Cook, A. Podelski, and A. Rybalchenko. Termination proofs for systems code. In PLDI'06: Programming Language Design and Implementation, 2006.
22. P. Cousot. Proving program invariance and termination by parametric abstraction, lagrangian relaxation and semidefinite programming. In VMCAI'05: Verification, Model Checking, and Abstract Interpretation, 2005.
23. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In POPL'78: Principles of Programming Languages, 1978.
24. C. Flanagan, S. N. Freund, S. Qadeer, and S. A. Seshia. Modular verification of multithreaded programs. Journal on Theoretical Computer Science, 338(1-3):153-183, 2005.
25. C. Flanagan and P. Godefroid. Dynamic partial-order reduction for model checking software. In POPL'05: Principles of Programming Languages, 2005.
26. C. Flanagan and S. Qadeer. Thread-modular model checking. In SPIN'03, 2003.
27. P. Godefroid. Partial-order methods for the verification of concurrent systems - an approach to the state-explosion problem. PhD thesis, 1994.
28. K. Havelund and T. Pressburger. Model checking Java programs using Java PathFinder. International Journal on Software Tools for Technology Transfer, 2(4), 1998.
29. T. A. Henzinger, R. Jhala, and R. Majumdar. Permissive interfaces. In FSE'05, 2005.
30. T. A. Henzinger, R. Jhala, R. Majumdar, and S. Qadeer. Thread-modular abstraction refinement. In CAV'03, 2003.
31. G. J. Holzmann. The model checker SPIN. IEEE Transactions on Software Engineering, 23(5):279-295, 1997.
32. B. Jacobs, K. R. M. Leino, F. Piessens, and W. Schulte. Safe concurrency for aggregate objects with invariants. In SEFM'05: Software Engineering and Formal Methods, 2005.
33. C. Jones. Specification and design of (parallel) programs. In IFIP Congress, 1983.
34. V. Kahlon, A. Gupta, and N. Sinha. Symbolic model checking of concurrent programs using partial orders and on-the-fly transactions. In CAV'06: International Conference on Computer Aided Verification, 2006.
35. R. J. Lipton. Reduction: a method of proving properties of parallel programs. Communications of the ACM, 18(12):717-721, 1975.
36. Z. Manna and A. Pnueli. Axiomatic approach to total correctness of programs. Acta Informatica, 1974.
37. A. Miné. The octagon abstract domain. Higher-Order and Symbolic Computation, 19:31-100, 2006.
38. A. Podelski and A. Rybalchenko. A complete method for the synthesis of linear ranking functions. In VMCAI'04: Verification, Model Checking, and Abstract Interpretation, 2004.
39. J. C. Reynolds. The Craft of Programming. London, 1981.
40. A. Tiwari. Termination of linear programs. In CAV'04: Computer Aided Verification, 2004.