Traces of program executions are a helpful source of information for program debugging. They, however, give a picture of program executions at such a low level that users often have diiculties to interpret the information. Opium, our extendable trace analyzer, is connected to a \standard" Prolog tracer. Opium is programmable and extendable. It provides a trace query language and abstract views ...

Roşu and Chen’s trace analysis algorithm identifies activity streams in a monitored application based on data (such as memory locations) and groups events accordingly into slices. It can be generalised to assign several such activity streams to the same slice, even if data is unrelated. This is useful for monitoring scheduling algorithms, which linearise activity streams that are not necessaril...

Traditionally, given two timing constraint sets, their relationship is defined by their timed trace inclusions. This approach only gives a boolean answer to if one set of constraints is contained within the other. In this paper, we first introduce a quantitative measure to describe the closeness or the similarity between two timing constraint sets. We intend to study the satisfaction bounds of ...

The paper proposes a theoretical approach of the debugging of constraint programs based on a notion of explanation tree. The proposed approach is an attempt to adapt algorithmic debugging to constraint programming. In this theoretical framework for domain reduction, explanations are proof trees explaining value removals. These proof trees are defined by inductive definitions which express the r...

Many privacy-type properties of security protocols can be modelled using trace equivalence properties in suitable process algebras. It has been shown that such properties can be decided for interesting classes of finite processes (i.e., without replication) by means of symbolic execution and constraint solving. However, this does not suffice to obtain practical tools. Current prototypes suffer ...

Recently, it has been shown that performance of a face recognition system depends on the quality of both face images participating in the recognition process: the reference and the test image. In the context of forensic face recognition, this observation has two implications: a) the quality of the trace (extracted from CCTV footage) constrains the performance achievable using a particular face ...

the changing of round and back vowel /u/ to unround and front vowel [i] occurs in lori dialects as well as some other persian dialects. this vowel change includes both unrounding and fronting. this paper aimed at coming up with an inclusive ranking of constraints to explain occurrence and nonoccurrence of this vowel change in various phonological environments in silahkori dialect within optimal...