Proving non-termination

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2008, Pages 147-158

  Gupta, Ashutosh K ^a   Henzinger, Thomas A ^b   Majumdar, Rupak ^c   Rybalchenko, Andrey ^a   Xu, Ru Gang ^c  

^a MAX PLANCK INSTITUTE FOR SOFTWARE SYSTEMS   (Germany)

^b EPFL   (Switzerland)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

model checking; non termination; program verification; recurrent sets; testing

Indexed keywords

INTEGER REPRESENTATION; LIVENESS; NON TERMINATIONS; PROGRAM VERIFICATION; RECURRENT SETS; SAFETY VERIFICATION; TERMINATION PROOF;

MODEL CHECKING; TESTING;

COMPUTER PROGRAMMING LANGUAGES;

EID: 84865648489     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1328438.1328459     Document Type: Conference Paper

References (29)

1. A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley, 1986.
2. T. Ball and S. K. Rajamani. The SLAM project: Debugging system software via static analysis. In Proc. POPL, pages 1-3. ACM, 2002.
3. Joshua Bloch. Nearly all binary searches and mergesorts are broken, June 2006. http://googleresearch.blogspot.com/2006/06/extra-extra-read-all-about-it- nearly.html.
4. A. Bradley, Z. Manna, and H. Sipma. The polyranking principle. In Proc. ICALP, LNCS 3580, pages 1349-1361. Springer, 2005.
5. E.M. Clarke, A. Biere, R. Raimi, and Y. Zhu. Bounded model checking using satisfiability solving. Formal Methods in System Design, 19(1): 7-34, 2001.
6. M. Colón and H. Sipma. Practical methods for proving program termination. In Proc. CAV, LNCS 2404, pages 442-454. Springer, 2002.
7. M. Colón, S. Sankaranarayanan, and H.B. Sipma. Linear invariant generation using non-linear constraint solving. In Proc. CAV, LNCS 2725, pages 420-432. Springer, 2003.
8. B. Cook, D. Kroening, and N. Sharygina. COGENT: Accurate theorem proving for program verification. In Proc. CAV, LNCS 3576, pages 296-300. Springer, 2005.
9. B. Cook, A. Podelski, and A. Rybalchenko. Termination proofs for systems code. In Proc. PLDI, pages 415-426. ACM, 2006.
10. P. Cousot. Proving program invariance and termination by parametric abstraction, Lagrangian relaxation and semidefinite programming. In Proc. VMCAI, LNCS 3385, pages 1-24. Springer, 2005.
11. M. d'Amorim and G. Rosu. Efficient monitoring of omega-languages. In Proc. CAV, LNCS 3576, pages 364-378. Springer, 2005.
12. V. Ganesh and D.L. Dill. A decision procedure for bit-vectors and arrays. In Proc. CAV, LNCS 4590, pages 519-531. Springer, 2007.
13. P. Godefroid. The soundness of bugs is what matters (position statement). In BUGS'2005 (PLDI'2005 Workshop on the Evaluation of Software Defect Detection Tools), 2005.
14. P. Godefroid, N. Klarlund, and K. Sen. DART: Directed automated random testing. In Proc. PLDI, pages 213-223. ACM, 2005.
15. B. Gulavani, T.A. Henzinger, Y. Kannan, A. Nori, and S.K. Rajamani. SYNERGY: A new algorithm for property checking. In Proc. FSE, pages 117-127. ACM, 2006.
16. T.A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In Proc. POPL, pages 58-70. ACM, 2002.
17. C. Holzbaur. OFAI clp(q,r) Manual, Edition 1.3.3. Austrian Research Institute for Artificial Intelligence, Vienna, 1995. TR-95-09.
18. D. Kapur. Automatically generating loop invariants using quantifier elimination. Technical Report 05431 (Deduction and Applications), IBFI Schloss Dagstuhl, 2006.
19. T. Kremenek and D.R. Engler. Z-ranking: Using statistical analysis to counter the impact of static analysis approximations. In Proc. SAS, LNCS 2694, pages 295-315. Springer, 2003.
20. A. Pnueli, A. Zaks, and L.D. Zuck. Monitoring interfaces for faults. Electr. Notes Theor. Comput. Sci., 144(4):73-89, 2006.
21. S. Sankaranarayanan, H.B. Sipma, and Z.Manna. Non-linear loop invariant generation using Gröbner bases. In Proc. POPL, pages 318-329. ACM, 2004.
22. A. Schrijver. Theory of Linear and Integer Programming. Wiley, 1986.
23. K. Sen, A. Vardhan, G. Agha, and G. Rosu. Efficient decentralized monitoring of safety in distributed systems. In Proc. ICSE, pages 418-427. ACM, 2004.
24. K. Sen, D. Marinov, and G. Agha. CUTE: A concolic unit testing engine for C. In Proc. FSE, pages 263-272. ACM, 2005.
25. H. Velroyen. Automatic non-termination analysis of imperative programs. Master's thesis, Chalmers University of Technology, Aachen Technical University, 2007.
26. E. Witchel. Mondriaan Memory Protection. PhD thesis, Massachusetts Institute of Technologys, 2004.
27. E. Witchel, J. Cates, and K. Asanović. Mondrian memory protection. In Proc. ASPLOS, pages 304-316. ACM, 2002.
28. E. Witchel, J. Rhee, and K. Asanovic. Mondrix: memory isolation for linux using mondriaan memory protection. In Proc. SOSP, pages 31-44. ACM, 2005.
29. Y. Xie and A. Aiken. Saturn: A SAT-based tool for bug detection. In Proc. CAV, LNCS 3576, pages 139-143. Springer, 2005.