From symptom to cause: Localizing errors in counterexample traces

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

Volumn , Issue , 2003, Pages 97-105

  Ball, Thomas ^a   Naik, Mayur ^a   Rajamani, Sriram K ^a  

^a NONE

Author keywords

Debugging; Software model checking

Indexed keywords

ALGORITHMS; COMPUTER SYSTEM RECOVERY; PROGRAM DEBUGGING; SYNTACTICS;

ERROR TRACES;

SOFTWARE ENGINEERING;

EID: 0037967760     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. T. Ball, R. Majumdar, T. Millstein, and S. K. Rajamani. Automatic predicate abstraction of C programs. In PLDI 01: Programming Language Design and Implementation, pages 203-213. ACM, 2001.
2. T. Ball and S. K. Rajamani. Bebop: A symbolic model checker for Boolean programs. In SPIN 00: SPIN Workshop, LNCS 1885, pages 113-130. Springer-Verlag, 2000.
3. T. Ball and S. K. Rajamani. The SLAM project: Debugging system software via static analysis. In POPL 02: Principles of Programming Languages, pages 1-3. ACM, 2002.
4. M. Beaven and R. Stansifer. Explaining type errors in polymorphic languages. ACM Letters on Programming Languages and Systems, 2(1-4):17-30, 1993.
5. K. Bhargavan, C. A. Gunter, M. Kim, I. Lee, D. Obradovic, O. Sokolsky, and M. Viswanathan. Verisim: Formal analysis of network simulations. IEEE Transactions on Software Engineering, 28(2):129-145, Feb. 2002.
6. O. Chitil. Compositional explanation of types and algorithmic debugging of type errors. In ICFP 01: International Conference on Functional Programming, pages 193-204. ACM, 2001.
7. J. Corbett, M. Dwyer, J. Hatcliff, C. Pasareanu, Robby, S. Laubach, and H. Zheng. Bandera: Extracting finite-state models from Java source code. In ICSE 2000: International Conference on Software Engineering, pages 439-448. ACM. 2000.
8. D. Duggan and F. Bent. Explaining type inference. Science of Computer Programming. 27(1):37-83. July 1996.
9. M. D. Ernst, J. Cockrell, W. G. Griswold, and D. Notkin. Dynamically discovering likely program invariants to support program evolution. IEEE Transactions in Software Engineering, 27(2):1-25, February 2001.
10. A. Groce and W. Visser. What went wrong: Explaining counterexamples. Technical Report 02-08, RIACS, USRA, 2002.
11. S. Hallem, B. Chelf, Y. Xie, and D. Engler. A system and language for building system-specific, static analyses. In PLDI 02: Programming Language Design and Implementation, pages 69-82. ACM, 2002.
12. S. Hangal and M. S. Lam. Tracking down software bugs using automatic anomaly detection. In ICSE 2000: International Conference on Software Engineering, pages 291-301. ACM, 2002.
13. C. Holzmann. Logic verification of ANSI-C code with Spin. In SPIN 00: SPIN Workshop, LNCS 1885, pages 131-147. Springer-Verlag, 2000.
14. S. Horwitz, T. Reps, and D. Binkley. Interprocedural slicing using dependence graphs. ACM Transactions on Programming Languages and Systems, 12(1):26-60, Jan. 1990.
15. H. Jin, K. Ravi, and F. Somenzi. Fate and free will in error traces. In TACAS 02: Tools and Algorithms for Construction and Analysis of Systems, LNCS 2031. pages 445-459. Springer-Verlag, 2002.
16. G. F. Johnson and J. A. Walz. A maximum flow approach to anomaly isolation in unification-based incremental type inference. In POPL 86: Principles of Programming Languages, pages 44-57. ACM. 1986.
17. B. Korel and J. Laski. Dynamic program slicing. Information Processing Letters, 29(10):155-163, October 1988.
18. T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In POPL 95: Principles of Programming Languages, pages 49-61. ACM, 1995.
19. S. Savage, M. Burrows, G. Nelson, P. Sobalvarro, and T. Anderson. Eraser: A dynamic data race detector for multithreaded programs. ACM Transactions on Computer Systems, 15(4):391-411, Nov. 1997.
20. E. Y. Shapiro. Algorithmic Program Debugging. MIT Press, 1982. ACM Distinguished Dissertation.
21. O. Sheyner, S. Jha, and J. M. Wing. Automated generation and analysis of attack graphs. In IEEE Symposium on Security and Privacy, pages 273-284. IEEE, 2002.
22. F. Tip and T. B. Dinesh. A slicing-based approach for locating type errors. ACM Transactions on Software Engineering and Methodology, 10(1):5-55, Jan. 2001.
23. M. Wand. Finding the source of type errors. In POPL 86: Principles of Programming Languages, pages 38-43. ACM, 1986.
24. M. Weiser. Program slicing. IEEE Transactions on Software Engineering, SE-10(4):352-357, July 1984.
25. A. Zeller. Yesterday, my program worked, today, it does not. why? In FSE 99: Foundations of Software Engineering, pages 253-267. ACM, 1999.