Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,061,543 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.
2010
2010
DECLARATIVE DEBUGGING OF MISSING ANSWERS FOR MAUDE SPEC IFICATIONS
A. Verdejo
,
N. Martí-Oliet
2010
Corpus ID: 13400046
Decla rative debugging is a semi-automatic technique that starts from an in- correct computation and locates a program fragment…
Expand
2009
2009
A Declarative Debugger for Maude Specifications: User Guide
A. Rodríguez
,
J. López
,
Narciso Martí Oliet
,
R. Caballero
2009
Corpus ID: 62738562
We show in this guide how to use our declarative debugger for Maude specifications. Declarative debugging is a semi-automatic…
Expand
2009
2009
Declarative Debugging of Missing Answers in Rewriting Logic
A. Verdejo
,
N. Mart
2009
Corpus ID: 18324149
Rewriting logic is a logic of change, where rewrites correspond to transitions between states. One of the main characteristics of…
Expand
2008
2008
Declarative Debugging of Maude Modules
A. Rodríguez
,
J. López
,
R. Caballero
,
Narciso Martí Oliet
2008
Corpus ID: 16947839
We introduce a declarative debugger for Maude modules: functional modules correspond to executable specifications in membership…
Expand
2000
2000
Using Model-Based Reasoning for Locating Faults in VHDL Designs
M. Stumptner
,
F. Wotawa
Künstliche Intell.
2000
Corpus ID: 718175
Model-based reasoning has seen successful application in hardware oriented and physical domains and many models of physical…
Expand
2000
2000
Towards Automating the Iterative Rapid Prototyping Process with the SLAM system
Ángel Herranz-Nieva
,
J. Moreno-Navarro
Jornadas de Ingeniería del Software y Bases de…
2000
Corpus ID: 14474483
There are two ways of constructing a reliable system. One is to make it so simple that there are no obvious deeciencies. The…
Expand
2000
2000
A Logical Framework for the Algorithmic Debugging of Lazy Functional-Logic Program
R. Caballero
,
F. J. López-Fraguas
,
M. Rodríguez-Artalejo
Workshop on Functional and Constraint Logic…
2000
Corpus ID: 16707879
Traditional debugging techniques are not well suited for lazy functional programming, because of the diicult-to-predict…
Expand
1998
1998
Debugging Systems for Constraint Programming ESPRIT 22532 Task T.WP3.4: Declarative Debugging in Constraint Programming Delivrable D.WP3.4.M2.1-3 Simplifiaction of Finite Domain Constraints
A. Tessier
1998
Corpus ID: 17529600
An important issue in Constraint Logic Programming (CLP) systems is how to output constraints in a usable form. Typically, only a…
Expand
1995
1995
Declarative debugging in Gödel
D. Binks
1995
Corpus ID: 37030600
1990
1990
DDS: A declarative debugging system for functional programs
N. Takahashi
,
S. Ono
Systems and Computers in Japan
1990
Corpus ID: 38246052
This paper describes the outline and implementation of the declarative debugging system DDS. The purpose of DDS is to provide the…
Expand