Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,178,544 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Computer program
Correctness (computer science)
Formal specification
Logic programming
Expand
Broader (1)
Debugging
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Declarative debugging of rewriting logic specifications
A. Riesco
,
A. Verdejo
,
N. Martí-Oliet
,
R. Caballero
J. Log. Algebraic Methods Program.
2009
Corpus ID: 10816265
2006
2006
JavaDD: a Declarative Debugger for Java
B. Jayaraman
,
Hani Z. Girgis
2006
Corpus ID: 14037586
paper presents a declarative approach to the debugging of object-oriented programs and illustrates the methodology through an…
Expand
Review
2003
Review
2003
An Overview of the SWI-Prolog Programming Environment
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…
Expand
2001
2001
A Debugging Scheme for Functional Logic Programs
M. Alpuente
,
F. J. Correa
,
M. Falaschi
Workshop on Functional and Constraint Logic…
2001
Corpus ID: 919491
2000
2000
A three-valued declarative debugging scheme
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…
Expand
Highly Cited
1999
Highly Cited
1999
On Automating Diagrammatic Proofs of Arithmetic Arguments
M. Jamnik
,
A. Bundy
,
Ian Green
Journal of Logic, Language and Information
1999
Corpus ID: 16093233
Theorems in automated theorem proving are usually proved by formal logical proofs. However, there is a subset of problems which…
Expand
Highly Cited
1997
Highly Cited
1997
A Declarative Debugging Scheme
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…
Expand
Highly Cited
1997
Highly Cited
1997
The Evaluation Dependence Tree as a Basis for Lazy Functional Debugging
H. Nilsson
,
Jan Sparud
International Conference on Automated Software…
1997
Corpus ID: 1156063
Lazy functional languages are declarative and allow the programmer to write programs where operational issues such as the…
Expand
Highly Cited
1987
Highly Cited
1987
Error Diagnosis in Logic Programming, an Adaption of E. Y. Shapiro's Method
G. Ferrand
The Journal of Logic Programming
1987
Corpus ID: 205115466
Highly Cited
1983
Highly Cited
1983
Algorithmic Program Debugging
E. Shapiro
1983
Corpus ID: 60699326
The thesis lays a theoretical framework for program debugging, with the goal of partly mechanizing this activity. In particular…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE