2008
DOI: 10.1016/j.entcs.2008.06.034
|View full text |Cite
|
Sign up to set email alerts
|

Declarative Debugging Meets the World

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2017
2017
2017
2017

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(4 citation statements)
references
References 5 publications
0
4
0
Order By: Relevance
“…(1) Using a source-to-source program transformation [Pope 1998;Caballero and Rodríguez-Artalejo 2002;Pope and Naish 2003;Chitil et al 2003;Pope 2006;Lux 2008]. The idea is to transform the program to be debugged, such that the code in charge of each computation returns its associated debugging tree combined with the original result.…”
Section: Implementation Techniquesmentioning
confidence: 99%
See 2 more Smart Citations
“…(1) Using a source-to-source program transformation [Pope 1998;Caballero and Rodríguez-Artalejo 2002;Pope and Naish 2003;Chitil et al 2003;Pope 2006;Lux 2008]. The idea is to transform the program to be debugged, such that the code in charge of each computation returns its associated debugging tree combined with the original result.…”
Section: Implementation Techniquesmentioning
confidence: 99%
“…The first alternative, a source to source transformation, was later explored in detail, given raise to Buddha [Pope 1998;, an algorithmic debugger for Haskell, and also algorithmic debuggers for multi-paradigm languages such as Toy and Curry [Caballero and Rodríguez-Artalejo 2002;Lux 2008]. However, the lack of efficiency of these proposals when considering large realistic programs gave rise to new proposals based on the modification of the compiler, which solves this problem.…”
Section: Functional Programmingmentioning
confidence: 99%
See 1 more Smart Citation
“…In practice, the Divide & Query strategy by Hirunkitti and Hogger [44] needs to perform less questions than other search strategies to find a bug, and this is why it has been implemented in almost all algorithmic debuggers (see, e.g., [85,10,24,88,67,13,87,46]). However, in Section 6.1.3 we showed that Divide & Query is not an optimal strategy because it does not take into consideration the structure of the tree.…”
Section: 1 Introductionmentioning
confidence: 99%