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

State of the Practice in Algorithmic Debugging

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
3
1
1
1

Relationship

2
4

Authors

Journals

citations
Cited by 8 publications
(11 citation statements)
references
References 2 publications
0
11
0
Order By: Relevance
“…This paper somehow summarizes and criticizes our own work to make a step forward. We claim that almost all current algorithmic debuggers-at least all that we know, including the most extended, which we compared in [7], and including our own implementationshave fundamental problems that were somehow inherited from the original formulation of AD [27].…”
Section: Some Problems Identified In Current Algorithmic Debuggersmentioning
confidence: 99%
“…This paper somehow summarizes and criticizes our own work to make a step forward. We claim that almost all current algorithmic debuggers-at least all that we know, including the most extended, which we compared in [7], and including our own implementationshave fundamental problems that were somehow inherited from the original formulation of AD [27].…”
Section: Some Problems Identified In Current Algorithmic Debuggersmentioning
confidence: 99%
“…In these cases the user can select a node whose subtree already has a wrong node. The algorithm of the standard architecture is not prepared for METs with multiple wrong nodes, but this situation can be easily handled adding Lines (15) to (19) in Frame 3 between Lines (14) and (15) of the selectNode method in Frame 1. These lines make the algorithm to restart the search in the subtree whose root is already marked as wrong.…”
Section: Static Met Architecturementioning
confidence: 99%
“…Otherwise, it projects the part of a chain whose weight is as close as possible to half the weight of the root (lines [17][18][19][20][21][22][23][24][25][26]. This allows for pruning half of the subtree when asking a question associated with a projection node.…”
Section: Algorithm 8 Shrink Efmentioning
confidence: 99%
See 2 more Smart Citations