Reducing the size of dynamic slicing with constraint solving

Proceedings - International Conference on Quality Software

Volumn , Issue , 2012, Pages 41-48

  Hofer, Birgit ^a   Wotawa, Franz ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Automated debugging; Constraint solving; Fault localization; Program slicing

Indexed keywords

AUTOMATED DEBUGGING; COMPUTATIONAL OVERHEADS; CONSTRAINT SOLVING; DYNAMIC SLICING; FAULT LOCALIZATION; ON DYNAMICS; PROGRAM SLICING; ROOT CAUSE;

SOFTWARE ENGINEERING;

PROGRAM DEBUGGING;

EID: 84869130880     PISSN: 15506002     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/QSIC.2012.44     Document Type: Conference Paper

References (21)

1. M. M. Brandis and H. Mössenböck, "Single-pass generation of static assignment form for structured languages," ACM TOPLAS, Vol. 16(6), pp. 1684-1698, 1994.
2. I. P. Gent, C. Jefferson, and I. Miguel, "Minion: A fast, scalable, constraint solver," In the Proceedings of the 17th European Conference on Artificial Intelligence, Vol. ECAI-6, pp. 98-102, 2006.
3. R. Greiner, B. A. Smith, and R. W. Wilkerson, "A correction to the algorithm in Reiters theory of diagnosis," Artificial Intelligence, Vol. 41, pp. 79-88, 1989.
4. N. Gupta, H. He, X. Zhang and R. Gupta, "Locating faulty code using failure-inducing chops," In the Proceedings of the 20th IEEE/ACM International Conference on Automated Software Engineering (ASE 2005), pp. 263-272, 2005.
5. B. Korel and J. Laski, "Dynamic Program Slicing," Information Processing Letters, Vol. 29, pp. 155-163, 1988.
6. B. Korel, J. Rilling, "Dynamic program slicing methods," Information & Software Technology, Vol. 40, pp. 647-659, 1998.
7. W. Mayer, R. Abreu, M. Stumptner, and A. J. van Gemund, "Prioritising model-based debugging diagnostic reports," in Proceedings of the International Workshop on Principles of Diagnosis (DX), pp. 127-134, 2009.
8. W. Mayer, "Static and hybrid analysis in model-based debugging," PhD Thesis, School of Computer and Information Science, University of South Australia, 2007.
9. M. Nica, S. Nica and F. Wotawa, "Does testing help to reduce the number of potentially faulty statements in debugging?," In the Proceedings of the 5th Int. Academic and Industrial Conference on Testing, TAIC PART'10, pp. 88-103, 2010.
10. R. Reiter, "A theory of diagnosis from first principles," Artificial Intelligence, Vol. 32, pp. 57-95, April 1987.
11. M. Sridharan, S. J. Fink, R. Bodik, "Thin slicing," Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation, pp. 112-122, 2007.
12. F. Tip, "A Survey of Program Slicing Techniques," Journal of Programming Languages, Vol. 3, no. 3, pp. 121-189, 1995.
13. M. Weiser, "Programmers use slices when debugging," Comm. of the ACM, Vol. 25, no. 7, pp. 446-452, Jul. 1982.
14. F. Wotawa and M. Nica, "On the compilation of programs into their equivalent constraint representation," Informatika, Vol. 32, pp. 359-371, 2008.
15. F. Wotawa, "On the Relationship between Model-Based Debugging and Program Slicing," Artificial Intelligence, Vol. 135, no. 1-2, pp. 124-143, 2002.
16. X. Zhang, N. Gupta, R. Gupta, "Pruning dynamic slices with confidence," SIGPLAN Not., ACM, Vol. 41, pp. 169-180, 2006.
17. X. Zhang, H. He, N. Gupta, and R. Gupta, "Experimental evaluation of using dynamic slices for fault localization," In the Proceedings of the Sixth Int. Symposium on Automated & Analysis-Driven Debugging (AADEBUG), pp. 33-42, 2005.
18. X. Zhang, S. Tallam, N. Gupta, R. Gupta, "Towards locating execution omission errors," SIGPLAN Not., ACM, Vol. 42, pp. 415-424, 2007.
19. X. Zhang, R. Gupta, and Y. Zhang. "Efficient forward computation of dynamic slices using reduced ordered binary decision diagrams," In the Proceedings of the Int. Conference on Software Engineering (ICSE), pp. 502-511, 2004.
20. X. Zhang, N. Gupta, and R. Gupta. "A study of effectiveness of dynamic slicing in locating real faults," Empirical Software Engineering, Vol. 12, pp. 143-160, 2006.
21. X. Zhang, S. Tallam, and R. Gupta. "Dynamic slicing long running programs through execution fast forwarding," In the Proceedings of the ACM SIGSOFT Symposium on Foundations of Software Engineering, pp. 81-91, 2006.