Foreword; p. 335

On the category of data dependency algebras and embeddings; pp. 337–355

Labelled BNF: a high-level formalism for defining well-behaved programming languages; pp. 356–377

Extracting high-level information from Petri nets: a railroad case; pp. 378–393

Fairness in automata theoretic model checking; pp. 394–412

Global invariants for analysing multi-threaded applications; pp. 413–436