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

Direct link
Cite
Citation style
  • apa
  • 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
Contributions to the declarative approach to debugging Prolog programs
Linköping University, Department of Computer and Information Science. Linköping University, The Institute of Technology.ORCID iD: 0000-0002-1485-0802
1989 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

Logic programs have the characteristic that their intended semantics can be expressed declaratively or operationally. Since the two semantics coincide, programmers may find it easier to adopt the declarative view when writing the program. But this causes a problem when the program is to be debugged. The actual semantics of a logic program is dependent on the specific implementation on which the program is run. Although the actual semantics is of operational nature it is usually different from the theoretical operational semantics. Hence debugging may require a comparison of the actual (operational) semantics of a program and its intended declarative semantics.

The idea of declarative debugging, first proposed by Shapiro under the term algorithmic debugging, is a methodology which leads to detecting errors in a logic program through knowledge about its intended declarative semantics. Current Prolog systems do not employ declarative diagnosis as an alternative to the basic tracer. This is partly due to the fact that the Shapiro’s declarative debugging system only dealt with pure Prolog programs, and partly due to practical limitations of the suggested methods and algorithms. This thesis consists of three papers. In these papers we point out practical problems with the use of basic declarative debugging systems, and present methods and algorithms which make the framework applicable to a wider range of Prolog programs. We introduce the concept of assertion that can ease communication between the user and the debugging system by reducing the number of necessary interactions, and introduce new debugging algorithms which are adapted to this extended notion. Further, we extend the basic debugging scheme to cover some built-in features of Prolog, and report on practical experience with a prototype declarative debugging system which incorporates the extensions.

Place, publisher, year, edition, pages
Linköping: Linköpings universitet , 1989. , p. 94
Series
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 187
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:liu:diva-160442Local ID: LiU-Tek-Lic-1989:27ISBN: 9178705320 (print)OAI: oai:DiVA.org:liu-160442DiVA, id: diva2:1352982
Available from: 2019-09-20 Created: 2019-09-20 Last updated: 2020-01-24Bibliographically approved

Open Access in DiVA

No full text in DiVA

Authority records BETA

Nadjm-Tehrani, Simin

Search in DiVA

By author/editor
Nadjm-Tehrani, Simin
By organisation
Department of Computer and Information ScienceThe Institute of Technology
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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