Error explanation with distance metrics
In the event that a system does not satisfy a specification, a model checker will typically
automatically produce a counterexample trace that shows a particular instance of the …
automatically produce a counterexample trace that shows a particular instance of the …
Error explanation with distance metrics
A Groce - International Conference on Tools and Algorithms for …, 2004 - Springer
In the event that a system does not satisfy a specification, a model checker will typically
automatically produce a counterexample trace that shows a particular instance of the …
automatically produce a counterexample trace that shows a particular instance of the …
A survey on algorithmic debugging strategies
J Silva - Advances in engineering software, 2011 - Elsevier
Algorithmic debugging is a debugging technique that has been extended to practically all
programming paradigms. Roughly speaking, the technique constructs an internal …
programming paradigms. Roughly speaking, the technique constructs an internal …
Declarative debugging of rewriting logic specifications
Declarative debugging is a semi-automatic technique that starts from an incorrect
computation and locates a program fragment responsible for the error by building a tree …
computation and locates a program fragment responsible for the error by building a tree …
Loop detection in term rewriting using the eliminating unfoldings
É Payet - Theoretical Computer Science, 2008 - Elsevier
In this paper, we present a fully automatizable approach to detecting loops in standard term
rewriting. Our method is based on semi-unification and an unfolding operation which …
rewriting. Our method is based on semi-unification and an unfolding operation which …
Termination of narrowing revisited
M Alpuente, S Escobar, J Iborra - Theoretical Computer Science, 2009 - Elsevier
This paper describes several classes of term rewriting systems (TRS's), where narrowing
has a finite search space and is still (strongly) complete as a mechanism for solving …
has a finite search space and is still (strongly) complete as a mechanism for solving …
[图书][B] Error explanation and fault localization with distance metrics
AD Groce - 2005 - search.proquest.com
When a program's correctness cannot be verified, a model checker produces a
counterexample that shows a specific instance of undesirable behavior. Given this …
counterexample that shows a specific instance of undesirable behavior. Given this …
Abstract diagnosis for timed concurrent constraint programs
M Comini, L Titolo, A Villanueva - Theory and Practice of Logic …, 2011 - cambridge.org
The timed concurrent constraint language (tccp in short) is a concurrent logic language
based on the simple but powerful concurrent constraint paradigm of Saraswat. In this …
based on the simple but powerful concurrent constraint paradigm of Saraswat. In this …
A declarative debugger for Maude functional modules
A declarative debugger for Maude functional modules, which correspond to executable
specifications in membership equational logic, is presented. Starting from an incorrect …
specifications in membership equational logic, is presented. Starting from an incorrect …
Declarative diagnosis of temporal concurrent constraint programs
We present a framework for the declarative diagnosis of non-deterministic timed concurrent
constraint programs. We present a denotational semantics based on a (continuous) …
constraint programs. We present a denotational semantics based on a (continuous) …