Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Declarative debugging is a semi-automatic debugging technique that abstracts the execution details to focus on results. This… 
2013
2013
Abduction as reasoning paradigm has been much explored in Artificial Intelligence, but not yet taken up by decision making as… 
2010
2010
Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment… 
2009
2009
We show in this guide how to use our declarative debugger for Maude specifications. Declarative debugging is a semi-automatic… 
2004
2004
This paper describes a simpler way for programmers to reason about the correctness of their code. The study of semantics of logic… 
2000
2000
Model-based reasoning has seen successful application in hardware oriented and physical domains and many models of physical… 
1992
1992
We show how declarative (or algorithmic) debugging can be applied to lazy functional programming and describe a prototype… 
1990
1990
In this paper we discuss a declarative approach to debugging for DATALOG, a logic programming language based on a bottom-up…