Tracers provide users with useful information about program executions. In this article, we propose a tracer driver . From a single tracer, it provides a powerful front-end enabling multiple dynamic analysis tools to be easily implemented, while limiting the overhead of the trace generation. The relevant execution events are speci ed by exible event patterns and a large variety of trace data ca...

Because of their complementary strengths, optimization and constraint programming can be profitably merged. Their integration has been the subject of increasing commercial and research activity. This paper summarizes and contrasts the characteristics of the two fields; in particular, how they use logical inference in different ways, and how these ways can be combined. It sketches the intellectu...

The use of constraint solvers, such as SATor PseudoBoolean-solvers, allows the extraction of the secret key from one or two side-channel traces. However, to use such a solver the cipher must be represented at bit-level. For byte-oriented ciphers this produces very large and unwieldy instances, leading to unpredictable, and often very long, run times. In this paper we describe a specialized byte...

Current paper presents a new method for solving hierarchical test generation constrainis. Unlike most of /he previous solvers. the proposed approach relies on the low-level model description of the constraints. The low-level model used is structurally synthesized BDDs, which are generated directly from the gate-level descriptions of the hierarchical modules. The method has been implemented and ...

This thesis intends to investigate two aspects of Constraint Handling Rules (CHR). It proposes a compositional semantics and a technique for program transformation. CHR is a concurrent committed-choice constraint logic programming language consisting of guarded rules, which transform multi-sets of atomic formulas (constraints) into simpler ones until exhaustion [Frü06] and it belongs to the dec...

This research proposes a computation approach to address the evaluation of end product machining accuracy in elliptical surfaced helical pipe bending using 6dof parallel manipulator as a pipe bender. The target end product is wearable metal muscle supporters used in build-to-order welfare product manufacturing. This paper proposes a product testing model that mainly corrects the surface directi...

We target application domains where the behavior of animals or humans is monitored using wireless sensor network (WSN) devices. The code on these devices is updated frequently, as scientists acquire in-field data and refine their hypotheses. Wireless reprogramming is therefore fundamental to avoid the (expensive) re-collection of the devices. Moreover, the code carried by the monitored individu...

A modern statement about the structural relationship between an ellipsis site and its antecedent runs as follows. an elided XP must have a syntactically identical antecedent XP’, modulo traces This is quite a bizzare condition. Why should some parts of structure count for being identical, and others not? Of all the possible relations between two structures, why does this one describe the ellips...

In this paper we investigate the foundations of a constraintbased compositional verification method for infinite-state systems. We first consider an asynchronous process calculus which is an abstract formalization of several existing languages based on the blackboard model. For this calculus we define a contraint-based symbolic representation of a compositional model based on traces. The constr...

ion, i.e. ha(a(d)) = a(hd(d)), so that two actions a(x) and b(y) cannot be mapped to the same abstract action. However, applying abstractions directly on a system’s specification S rather than on its LTS leads to a loss of precision. Let S be the abstract interpretation of S, and let M and M be their underlying LTSs. It is well known that M is only an overapproximation of α(M), with α(M) denoti...