Whodunit? Causal analysis for counterexamples

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

Volumn 4218 LNCS, Issue , 2006, Pages 82-95

  Wang, Chao ^a   Yang, Zijiang ^b   Ivančić, Franjo ^a   Gupta, Aarti ^a  

^a NEC LABORATORIES AMERICA   (United States)

^b Parkview Campus   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE; MATHEMATICAL MODELS; SOFTWARE ENGINEERING; SYNTACTICS;

INFEASIBILITY; PUBLIC-DOMAIN; SYNTACTIC-LEVEL PROOF;

COMPUTER PROGRAMMING LANGUAGES;

EID: 33845216260     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11901914_9     Document Type: Conference Paper

References (26)

1. H. Agrawal, R. A. DeMillo, and E. H. Spafford. Debugging with dynamic slicing and backtracking. Software - Practice and Experience, 23(6):589-616, 1993.
2. F. A. Aloul, B. D. Sierawski, and K. A. Sakallah. Satometer: How much have we searched? In Proceedings of the Design Automation Conference, pages 737-742, New Orleans, LA, June 2002.
3. T. Ball, M. Naik, and S. K. Rajamani. From symptom to cause: Localizing errors in counterexample traces. In Symposium on Principles of Programming Languages (POPL'03), pages 97-105, January 2003.
4. I. Beer, S. Ben-David, C. Eisner, and Y. Rodeh. Efficient detection of vacuity in ACTL formulas. In Computer Aided Verification (CAV'97), pages 279-290. Springer, 1997. LNCS 1254.
5. E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proceedings Workshop on Logics of Programs, pages 52-71, Berlin, 1981. Springer-Verlag. LNCS 131.
6. H. Cleve and A. Zeller. Locating causes of program failures. In ACM/IEEE International Conference on Software Engineering, 2005.
7. A. Coen-Porisini, G. Denaro, C. Ghezzi, and M. Pezze. Using symbolic execution for verifying safety-critical systems. In European Software Engineering Conference/Foundations of Software Engineering, pages 142-151, 2001.
8. E. Dijkstra. A Discipline of Programming. Pretice Hall, NJ, 1976.
9. A. Griesmayer, R. Bloem, and B. Cook. Repair of boolean programs with an application to c. In Computer Aided Verification (CAV'06). Springer, 2006. LNCS series.
10. A. Groce, S. Chaki, D. Kroening, and O. Strichman. Error explanation with distance metrics. International Journal on Software Tools for Technology Transfer, 2005.
11. A. Grace and W. Visser. What went wrong: Explaining counterexamples. In Model Checking of Software: 10th International SPIN Workshop, pages 121-135. Springer-Verlag, May 2003. LNCS 2648.
12. T. Gyimóthy, Á. Beszédes, and I. Forgács. An efficient relevant slicing method for debugging. In 7th European Software Engineering Conference (ESEC/FSE'99), pages 303-321. Springer, 1999. LNCS 1687.
13. H. Jain, F. Ivančić, A. Gupta, and M. Ganai. Localization and register sharing for predicate abstraction. In Tools and Algorithms for the Construction and Abnalysis of Systems (TACAS'05), pages 394-409. Springer, 2005. LNCS 3440.
14. H. Jain, F. Ivančić, A. Gupta, I. Shlyakhter, and C. Wang. Using statically computed invariants inside the predicate abstraction and refinement loop. In Computer Aided Verification (CAV'06). Springer, 2006. LNCS series.
15. B. Jobstmann, A. Griesmayer, and R. Bloem. Program repair as a game. In Computer Aided Verification (CAV '05), pages 226-238. Springer, 2005. LNCS 3576.
16. J. A. Jones, M. J. Harrold, and J. Stasko. Visualization of test information to assist fault localization. In ACM/IEEE International Conference on Software Engineering, 2002.
17. B. Korel and J. W. Laski. Dynamic slicing of computer programs. Journal of Systems and Software, 13(3):187-195, 1990.
18. O. Kupferman and M. Y. Vardi. Vacuity detection in temporal model checking. In Correct Hardware Design and Verification Methods (CHARME'99), pages 82-96, Berlin, September 1999. Springer-Verlag. LNCS 1703.
19. K. L. McMillan and N. Amla. Automatic abstraction without counterexamples. In Tools and Algorithms for Construction and Analysis of Systems (TACAS'03), pages 2-17, April 2003. LNCS 2619.
20. K. S. Namjoshi and R. P. Kurshan. Syntactic program transformations for automatic abstraction. In Computer Aided Verification (CAV'00), pages 435-449. Springer, 2000. LNCS 1855.
21. M. Purandare and F. Somenzi. Vacuum cleaning CTL formulae. In Computer Aided Verification (CAV'02), pages 485-499. Springer-Verlag, July 2002. LNCS 2404.
22. J. P. Quielle and J. Sifakis. Specification and verification of concurrent systems in CESAR. In Proceedings of the Fifth Annual Symposium on Programming, 1981.
23. M. Renieris and S. P. Reiss. Fault localization with nearest neighbor queries. In International Conference on Automated Software Engineering, pages 30-39, Montreal, Canada, October 2003.
24. G. Rothermel and M.J. Harrold. Empirical studies of a safe regression test selection technique. Software Engineering, 24:401-419, 1999.
25. S. Staber, B. Jobstmann, and R. Bloem. Finding and fixing faults. In Correct Hardware Design and Verification Methods (CHARME '05), pages 35-49. Springer, 2005. LNCS 3725.
26. A. Zeller. Isolating cause-effect chains from computer programs. In Symposium on the Foundations of Software Engineering (FSE'02), pages 1-10, November 2002.