This new edition of Introduction to Lattices and Order presents a radical reorganization and
updating, though its primary aim is unchanged. The explosive development of theoretical …

The worker/wrapper transformation is a technique for changing the type of a computation,
usually with the aim of improving its performance. It has been used by compiler writers for …

The rely-guarantee technique allows one to reason compositionally about concurrent
programs. To handle interference the technique makes use of rely and guarantee …

Relational program derivation is the technique of stepwise refining a relational specification
to a program by algebraic rules. The program thus obtained is correct by construction …

Refinement types are a powerful formalism with many applications in program verification,
compiler optimization, etc. We present our work-in-progress on MachineArithmetic, an …

Tabling is a powerful resolution mechanism for logic programs that captures their least fixed
point semantics more faithfully than plain Prolog. In many tabling applications, we are not …

Formal semantics of programming languages needs to model the potentially infinite state
transition behavior of programs as well as the computation of their final results …

• For all A∈ SetS, HBintree (X)(A) btree= HcoBintree (X)(A) btree= 1+ Abtree× X× Abtree
and HinfBintree (X)(A) btree= Abtree× X× Abtree.• µBintree (X) btree∼= T where T is the …

Un document structuré complexe est représenté intentionnellement sous la forme d'une
structure arborescente décorée par des attributs. Les structures licites sont caractérisées par …

Finite state machines (FSMs) are an appealing mechanism for simple practical
computations: They lend themselves to very e cient and deterministic implementation, are …