liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Bug Localization by Algorithmic Debugging and Program Slicing
Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.
Linköping University, Department of Computer and Information Science, PELAB - Programming Environment Laboratory. Linköping University, The Institute of Technology.ORCID iD: 0000-0002-3435-4996
1990 (English)In: Programming Language Implementation and Logic Programming, Springer Berlin/Heidelberg, 1990, 60-74 p.Conference paper, Published paper (Refereed)
Abstract [en]

This paper presents a generalized version of algorithmic debugging, a method for semi-automatic bug localization. The method is generally applicable to procedural languages, and is not dependent on any ad hoc assumptions regarding the subject program. The original form of algorithmic debugging, introduced by Shapiro [Shapiro-83], is however limited to small Prolog programs without side-effects. Another drawback of the original method is the large number of interactions with the user during bug localization. To our knowledge, this work is the first generalization of algorithmic debugging for programs with side-effects written in imperative languages such as Pascal. Also, we have improved the search method in a way that eliminates many irrelevant questions to the programmer during bug localization. This makes it feasible to debug larger programs. The focusing of the localization process is achieved by using program slicing, a data flow analysis technique, to dynamically compute which parts of the program are relevant for the search. A prototype generalized algorithmic debugger for Pascal has been implemented in Pascal.

Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 1990. 60-74 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online) ; 456
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
URN: urn:nbn:se:liu:diva-110056DOI: 10.1007/BFb0024176ISBN: 978-3-540-53010-7 (print)ISBN: 978-3-540-46298-9 (print)OAI: oai:DiVA.org:liu-110056DiVA: diva2:742557
Conference
International Workshop PLILP '90 Linköping, Sweden, August 20–22, 1990
Available from: 2014-09-02 Created: 2014-09-02 Last updated: 2014-09-30Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Kamkar, MariamShahmehri, NahidFritzson, Peter

Search in DiVA

By author/editor
Kamkar, MariamShahmehri, NahidFritzson, Peter
By organisation
Department of Computer and Information ScienceThe Institute of TechnologyPELAB - Programming Environment Laboratory
Electrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 55 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf