This report presents a catalogue of global constraints where each constraint is explicitly
described in terms of graph properties and/or automata and/or first order logical formulae …

We present linear-time algorithms for the classic problem of finding dominators in a
flowgraph, and for several other problems whose solutions require evaluating a function …

The computation of dominators in a flowgraph has applications in several areas, including
program optimization, circuit testing, and theoretical biology. Lengauer and Tarjan [] …

The problem of finding dominators in a directed graph has many important applications,
notably in global optimization of computer code. Although linear and near-linear-time …

The circuit constraint is used to constrain a graph represented by a successor for each node,
such that the resulting edges form a circuit. Circuit and its variants are important for various …

How does one verify that the output of a complicated program is correct? One can formally
prove that the program is correct, but this may be beyond the power of existing methods …

Recently novel distributed approaches to the formation of collaborative networked
organizations have been proposed. Some of them make use of logical–formal structures (ie …

This report presents a catalogue of global constraints where each constraint is explicitly
described in terms of graph properties and/or automata and/or first order logical formulae …

De nombreuses applications informatiques nécessitent de résoudre des problèmes de
décision qui sont difficiles d'un point de vue mathématique. La programmation par …

This paper revisits the tree constraint introduced in [2] which partitions the nodes of an-
nodes, m-arcs directed graph into a set of node-disjoint anti-arborescences for which only …