UML class diagrams are widely used to model the static structure of object-oriented software systems. As a supplement, OCL becomes more and more popular for formulating constraints that can not be modeled by the diagrams. In this paper, we extend OCL with elements of temporal logic. With this extension, constraints on the temporal development of the system structure as well as on the system beh...

This paper addresses two linked phenomena of longstanding interest: the existence of childspecific phonological patterns which are not attested in adult language, and the puzzling developmental trajectory of these patterns. While some child-specific phonological patterns wane gradually as the child matures, others follow a U-shaped curve, and still others persist unchanged for an extended perio...

In order to design and implement tracers, one must decide what exactly to trace and how to produce this trace. On the one hand, trace designs are too often guided by implementation concerns and are not as useful as they should be. On the other hand, an interesting trace which cannot be produced efficiently, is not very useful either. In this article we propose a methodology which helps to effic...

In this paper, we study synthesis from logical specifications over finite traces expressed in LTLf and its extension LDLf . Specifically, in this form of synthesis, propositions are partitioned in controllable and uncontrollable ones, and the synthesis task consists of setting the controllable propositions over time so that, in spite of how the value of the uncontrollable ones changes, the spec...

FDBG (short for Finite domain DeBuGger) is a tool addressing the problems of debugging nite domain (FD) constraint programs. Implemented as a SICStus Prolog library, it allows CLP(FD) programmers to trace FD variable domain changes. FDBG is capable of detecting the wake-up of constraints as well as the steps of labeling, and it reports the e ects of these events on the variables. The simplest w...

We study the problem of enabling general 2D and 3D variational constraint representation to be used in conjunction with a feature hierarchy representation, where some of the features may use procedural or other non-constraint based representations. We trace the challenge to a requirement on constraint decomposition algorithms or decomposition-recombination (DR) planners used by most variational...

The symbolic verification of the security property of a cryptographic protocol for a bounded number of sessions is usually expressed as a symbolic trace reachability problem. Such a problem can be expressed as a constraint system for deducibility constraints for a certain inference system describing the possible actions of an attacker. We show that symbolic trace reachability for well-defined p...

The generic trace format GenTra4CP has been defined in 2004 with the goal of becoming a standard trace format for the observation of constraint solvers over finite domains. It has not been used since. This paper defines the concept of generic trace formally, based on simple transformations of traces. It then analyzes, and occasionally corrects, shortcomings of the proposed initial format and sh...