An efficient relevant slicing method for debugging

T. Gyimóthy, A. Beszédes, István Forgács

Research output: Chapter in Book/Report/Conference proceedingConference contribution

85 Citations (Scopus)

Abstract

Dynamic program slicing methods are widely used for debugging, because many statements can be ignored in the process of localizing a bug. A dynamic program slice with respect to a variable contains only those statements that actually had an influence on this variable. How- ever, during debugging we also need to identify those statements that actually did not affect the variable but could have affected it had they been evaluated differently. A relevant slice includes these potentially affecting statements as well, therefore it is appropriate for debugging. In this paper a forward algorithm is introduced for the computation of relevant slices of programs. The space requirement of this method does not depend on the number of different dynamic slices nor on the size of the execution history, hence it can be applied for real size applications.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages303-321
Number of pages19
Volume1687 LNCS
Publication statusPublished - 1999
Event7th European Software Engineering Conference, ESEC 1999 - Held Jointly with the 7th ACM SIGSOFT Symposium on the Foundations of Software Engineering, FSE 1999 - Toulouse, France
Duration: Sep 6 1999Sep 10 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1687 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other7th European Software Engineering Conference, ESEC 1999 - Held Jointly with the 7th ACM SIGSOFT Symposium on the Foundations of Software Engineering, FSE 1999
CountryFrance
CityToulouse
Period9/6/999/10/99

Fingerprint

Slicing
Debugging
Slice
Program Slicing
Requirements

Keywords

  • Debugging
  • Dynamic slicing
  • Relevant slicing

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Gyimóthy, T., Beszédes, A., & Forgács, I. (1999). An efficient relevant slicing method for debugging. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1687 LNCS, pp. 303-321). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1687 LNCS).

An efficient relevant slicing method for debugging. / Gyimóthy, T.; Beszédes, A.; Forgács, István.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1687 LNCS 1999. p. 303-321 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1687 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Gyimóthy, T, Beszédes, A & Forgács, I 1999, An efficient relevant slicing method for debugging. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1687 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1687 LNCS, pp. 303-321, 7th European Software Engineering Conference, ESEC 1999 - Held Jointly with the 7th ACM SIGSOFT Symposium on the Foundations of Software Engineering, FSE 1999, Toulouse, France, 9/6/99.
Gyimóthy T, Beszédes A, Forgács I. An efficient relevant slicing method for debugging. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1687 LNCS. 1999. p. 303-321. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Gyimóthy, T. ; Beszédes, A. ; Forgács, István. / An efficient relevant slicing method for debugging. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1687 LNCS 1999. pp. 303-321 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{26adfdd343644a1c9dcbf0f80b21fb5a,
title = "An efficient relevant slicing method for debugging",
abstract = "Dynamic program slicing methods are widely used for debugging, because many statements can be ignored in the process of localizing a bug. A dynamic program slice with respect to a variable contains only those statements that actually had an influence on this variable. How- ever, during debugging we also need to identify those statements that actually did not affect the variable but could have affected it had they been evaluated differently. A relevant slice includes these potentially affecting statements as well, therefore it is appropriate for debugging. In this paper a forward algorithm is introduced for the computation of relevant slices of programs. The space requirement of this method does not depend on the number of different dynamic slices nor on the size of the execution history, hence it can be applied for real size applications.",
keywords = "Debugging, Dynamic slicing, Relevant slicing",
author = "T. Gyim{\'o}thy and A. Besz{\'e}des and Istv{\'a}n Forg{\'a}cs",
year = "1999",
language = "English",
isbn = "3540665382",
volume = "1687 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "303--321",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - An efficient relevant slicing method for debugging

AU - Gyimóthy, T.

AU - Beszédes, A.

AU - Forgács, István

PY - 1999

Y1 - 1999

N2 - Dynamic program slicing methods are widely used for debugging, because many statements can be ignored in the process of localizing a bug. A dynamic program slice with respect to a variable contains only those statements that actually had an influence on this variable. How- ever, during debugging we also need to identify those statements that actually did not affect the variable but could have affected it had they been evaluated differently. A relevant slice includes these potentially affecting statements as well, therefore it is appropriate for debugging. In this paper a forward algorithm is introduced for the computation of relevant slices of programs. The space requirement of this method does not depend on the number of different dynamic slices nor on the size of the execution history, hence it can be applied for real size applications.

AB - Dynamic program slicing methods are widely used for debugging, because many statements can be ignored in the process of localizing a bug. A dynamic program slice with respect to a variable contains only those statements that actually had an influence on this variable. How- ever, during debugging we also need to identify those statements that actually did not affect the variable but could have affected it had they been evaluated differently. A relevant slice includes these potentially affecting statements as well, therefore it is appropriate for debugging. In this paper a forward algorithm is introduced for the computation of relevant slices of programs. The space requirement of this method does not depend on the number of different dynamic slices nor on the size of the execution history, hence it can be applied for real size applications.

KW - Debugging

KW - Dynamic slicing

KW - Relevant slicing

UR - http://www.scopus.com/inward/record.url?scp=84887476214&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84887476214&partnerID=8YFLogxK

M3 - Conference contribution

SN - 3540665382

SN - 9783540665380

VL - 1687 LNCS

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

SP - 303

EP - 321

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

ER -