Skip to search formSkip to main contentSkip to account menu

Algorithmic program debugging

Known as: Declarative Debugging 
Algorithmic debugging (also called declarative debugging) is a debugging technique that compares the results of sub-computations with what the… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2006
2006
paper presents a declarative approach to the debugging of object-oriented programs and illustrates the methodology through an… 
Review
2003
Review
2003
  • J. Wielemaker
  • Workshop on Logic Programming Environments
  • 2003
  • Corpus ID: 5065685
The Prolog programmer’s needs have always been the focus for guiding the development of the SWI-Prolog system. This article… 
2001
2001
2000
2000
  • L. Naish
  • Proceedings 23rd Australasian Computer Science…
  • 2000
  • Corpus ID: 5605563
Declarative debugging has many advantages over conventional approaches to debugging for logic and functional programs. This paper… 
Highly Cited
1999
Highly Cited
1999
Theorems in automated theorem proving are usually proved by formal logical proofs. However, there is a subset of problems which… 
Highly Cited
1997
Highly Cited
1997
  • L. Naish
  • Journal of Functional and Logic Programming
  • 1997
  • Corpus ID: 7389173
We present a very simple but flexible declarative debugging scheme. A Abstract-1 declarative debugger can be defined in Prolog… 
Highly Cited
1997
Highly Cited
1997
Lazy functional languages are declarative and allow the programmer to write programs where operational issues such as the… 
Highly Cited
1987
Highly Cited
1987
  • G. Ferrand
  • The Journal of Logic Programming
  • 1987
  • Corpus ID: 205115466
Highly Cited
1983
Highly Cited
1983
The thesis lays a theoretical framework for program debugging, with the goal of partly mechanizing this activity. In particular…