Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

7 relations
Computer programCorrectness (computer science)Formal specificationLogic programming
Expand

Broader (1)

Debugging

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
Declarative Debugging of Rewriting Logic Specifications
Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The Evaluation Dependence Tree as a Basis for Lazy Functional Debugging
Lazy functional languages are declarative and allow the programmer to write programs where operational issues such as the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
DDT: a Declarative Debugging Tool for Functional-Logic Languages
We present a graphical tool for the declarative debugging of wrong answers in functional-logic languages. The tool, integrated in… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2002
2002
Abstract Diagnosis of Functional Programs
We present a generic scheme for the declarative debugging of functional programs modeled as term rewriting systems. We associate… Expand
Is this relevant?
2000
2000
A three-valued declarative debugging scheme
  • Lee 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… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1999
1999
On Automating Diagrammatic Proofs of Arithmetic Arguments
Theorems in automated theorem proving are usually proved by formal logical proofs. However, there is a subset of problems which… Expand
  • figure 11.3
Is this relevant?
Highly Cited
1997
Highly Cited
1997
A Declarative Debugging Scheme
  • Lee Naish
  • J. Funct. Log. Program.
  • 1997
    • Corpus ID: 7389173
We present a very simple but flexible declarative debugging scheme. A Abstract-1 declarative debugger can be defined in Prolog… Expand
  • figure 1
  • figure 4
  • figure 7
  • figure 10
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Algorithmic Debugging for Lazy Functional Languages
Lazy functional languages are declarative and allow the programmer to write programs where operational issues such as the… Expand
Is this relevant?
1992
1992
Declarative Debugging of Lazy Functional Programs
We show how declarative (or algorithmic) debugging can be applied to lazy functional programming and describe a prototype… Expand
Is this relevant?
Highly Cited
1983
Highly Cited
1983
Algorithmic Program Debugging
The thesis lays a theoretical framework for program debugging, with the goal of partly mechanizing this activity. In particular… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE