Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.
Algorithmic program debugging
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment… Expand
2005
2005
The new generic scheme CFLP($\mathcal{D}$) has been recently proposed in [14] as a logical and semantic framework for lazy… Expand
Highly Cited
2004
Highly Cited
2004
Lazy functional languages are declarative and allow the programmer to write programs where operational issues such as the… Expand
Review
2003
Review
2003
The Prolog programmer’s needs have always been the focus for guiding the development of the SWI-Prolog system. This article… Expand
2002
2002
We present a generic scheme for the declarative debugging of functional programs modeled as term rewriting systems. We associate… Expand
2000
2000
Declarative debugging has many advantages over conventional approaches to debugging for logic and functional programs. This paper… Expand
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… Expand
Highly Cited
1994
Highly Cited
1994
Lazy functional languages are declarative and allow the programmer to write programs where operational issues such as the… Expand
1992
1992
We show how declarative (or algorithmic) debugging can be applied to lazy functional programming and describe a prototype… Expand
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… Expand