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 …

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 …

Unintended failures during a computation are painful but frequent during software
development. Failures due to external reasons (eg, missing files, no permissions) can be …

Algorithmic debugging is a debugging technique that has been extended to practically all
programming paradigms. Roughly speaking, the technique constructs an internal …

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 …

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 …

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 …

When a program's correctness cannot be verified, a model checker produces a
counterexample that shows a specific instance of undesirable behavior. Given this …

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 …

We present a framework for the declarative diagnosis of non-deterministic timed concurrent
constraint programs. We present a denotational semantics based on a (continuous) …