A methodology for reasoning about logic programs and their specifications is applied to program debugging as well as program synthesis. Specifications in the form of an executable model of the desired program are used to generate test cases, locate bugs, and guide bug correction. Both deductive and inductive inference techniques are employed for bug correction and synthesis. The behavior of the automated debugger is demonstrated through several examples
We present a declarative debugger for lazy functional logic programs with polymorphic type disciplin...
We present a generic scheme for the declarative debugging of functional logic programs which is vali...
AbstractWe prove a completeness theorem for an improved practical declarative debugger for arbitrary...
A methodology for reasoning about logic programs and their specifications is applied to program debu...
152 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1988.This dissertation addresses t...
AbstractProgramming environments are essential for the acceptance of programming languages. This sur...
Algorithmic debugging, as presented by Shapiro, is an interactive process where the debugging system...
We propose debugging tools for the development of environments for logic programming languages. Suc...
this paper is to examine recent and current debugging approaches that promise to have the potential ...
We propose a new methodology for synthesizing correct functional logic programs. We aim to create an...
The thesis describes a new approach to declarative debugging (error diagnosis) of logic programs, in...
Programming environments are essential for the acceptance of programming languages. This survey emph...
We present a generic scheme for the declarative debugging of programs that are written in rewriting-...
There are many ways to find bugs in programs. For example, observed input and output values can be c...
We present a general framework for the declarative debugging of functional logic programs, which is ...
We present a declarative debugger for lazy functional logic programs with polymorphic type disciplin...
We present a generic scheme for the declarative debugging of functional logic programs which is vali...
AbstractWe prove a completeness theorem for an improved practical declarative debugger for arbitrary...
A methodology for reasoning about logic programs and their specifications is applied to program debu...
152 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1988.This dissertation addresses t...
AbstractProgramming environments are essential for the acceptance of programming languages. This sur...
Algorithmic debugging, as presented by Shapiro, is an interactive process where the debugging system...
We propose debugging tools for the development of environments for logic programming languages. Suc...
this paper is to examine recent and current debugging approaches that promise to have the potential ...
We propose a new methodology for synthesizing correct functional logic programs. We aim to create an...
The thesis describes a new approach to declarative debugging (error diagnosis) of logic programs, in...
Programming environments are essential for the acceptance of programming languages. This survey emph...
We present a generic scheme for the declarative debugging of programs that are written in rewriting-...
There are many ways to find bugs in programs. For example, observed input and output values can be c...
We present a general framework for the declarative debugging of functional logic programs, which is ...
We present a declarative debugger for lazy functional logic programs with polymorphic type disciplin...
We present a generic scheme for the declarative debugging of functional logic programs which is vali...
AbstractWe prove a completeness theorem for an improved practical declarative debugger for arbitrary...
DOI
Add to ORKG