Looper: Lightweight detection of infinite loops at runtime

ASE2009 - 24th IEEE/ACM International Conference on Automated Software Engineering

Volumn , Issue , 2009, Pages 161-169

  Burnim, Jacob ^a   Jalbert, Nicholas ^a   Stergiou, Christos ^a   Sen, Koushik ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED TECHNIQUES; JAVA APPLICATIONS; JAVA PROGRAM; OPEN-SOURCE; PROGRAM VALUE; PROTOTYPE TOOLS; RUNTIMES; SYMBOLIC EXECUTION;

AUTOMATION; BENCHMARKING; FILE EDITORS; JAVA PROGRAMMING LANGUAGE; PROGRAM DEBUGGING; SOFTWARE PROTOTYPING;

STRUCTURED PROGRAMMING;

EID: 77952209743     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASE.2009.87     Document Type: Conference Paper

References (18)

1. P. Godefroid, N. Klarlund, and K. Sen, "DART: directed automated random testing," in Programming language design and implementation. ACM, 2005, pp. 213-223.
2. K. Sen, D. Marinov, and G. Agha, "CUTE: a concolic unit testing engine for C," in ESEC/FSE-13. ACM, 2005, pp. 263-272.
3. A. Gupta, T. A. Henzinger, R. Majumdar, A. Rybalchenko, and R.-G. Xu, "Proving non-termination," in POPL. ACM, 2008, pp. 147-158.
4. R. Vallee-Rai, L. Hendren, V. Sundaresan, P. Lam, E. Gagnon, and P. Co, "Soot - a Java optimization framework," in CASCON 1999, 1999, pp. 125-135.
5. B. Dutertre and L. M. de Moura, "A fast linear-arithmetic solver for dpll(t)," in Computer Aided Verification, ser. LNCS, vol.4144, 2006, pp. 81-94.
6. M. A. Colón, S. Sankaranarayanan, and H. B. Sipma, "Linear invariant generation using non-linear constraint solving," Computer Aided Verification, 2003.
7. D. Kapur, "Automatically generating loop invariants using quantifier elimination," in IMACS Intl. Conf. on Applications of Computer Algebra, vol.116, 2004.
8. S. Sankaranarayanan, H. B. Sipma, and Z. Manna, "Non-linear loop invariant generation using gröbner bases," in POPL '04. New York, NY, USA: ACM, 2004, pp. 318-329.
9. H. Velroyen and P. Rümmer, "Non-termination checking for imperative programs," in Tests and Proofs, Second International Conference, TAP 2008, Prato, Italy, ser. LNCS, vol.4966. Springer, 2008, pp. 154-170.
10. B. Cook, A. Podelski, and A. Rybalchenko, "Termination proofs for systems code," in Programming language design and implementation. ACM, 2006, pp. 415-426.
11. A. Podelski and A. Rybalchenko, "A complete method for the synthesis of linear ranking functions," Lecture notes in computer science, pp. 239-251, 2003.
12. J. Berdine, B. Cook, D. Distefano, and P. O'Hearn, "Automatic termination proofs for programs with shape-shifting heaps," Computer Aided Verification, 2006. [Online]. Available: http://dx.doi.org/10.1007/11817963 35
13. J. Berdine, A. Chawdhary, B. Cook, D. Distefano, and P. O'Hearn, "Variance analyses from invariance analyses," in Proceedings of the 2007 POPL Conference, vol.42, no.1. ACM New York, NY, USA, 2007, pp. 211-224.
14. B. Cook, A. Podelski, and A. Rybalchenko, "Proving thread termination," in Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation. ACM New York, NY, USA, 2007, pp. 320-330.
15. A. R. Bradley, Z. Manna, and H. B. Sipma, "The polyranking principle," Automata, Languages and Programming, pp. 1349-1361, 2005.
16. P. Cousot, "Proving program invariance and termination by parametric abstraction, lagrangian relaxation and semidefinite programming," in Proc. VMCAI, vol.3385. Springer, 2005, pp. 1-24.
17. J. Giesl, P. Schneider-Kamp, and R. Thiemann, "AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework," LECTURE NOTES IN COMPUTER SCIENCE, vol.4130, p. 281, 2006.
18. C. Lee, N. Jones, and A. Ben-Amram, "The Size-Change Principle for Program Termination," in Annual Symposium on Principles of Programming Languages: Proceedings of the 28 th ACM SIGPLAN-SIGACT symposium on Principles of programming languages: London, United Kingdom, vol.2001, 2001, pp. 81-92.