Theoretical Computer Science, Volume 126

Volume 126, Number 1, 11 April 1994

Selected Papers of the Seventeenth Colloquium on Trees in Algebra and Programming (CAAP'92) and of the European Symposium on Programming (ESOP'92)

Henrik Reif Andersen: Model Checking and Boolean Graphs. 3-30
Anne-Cécile Caron, Jean-Luc Coquidé: Decidability of Reachability for Disjoint Union of Term Rewriting Systems. 31-52
Bruno Courcelle: Monadic Second-Order Definable Graph Transductions: A Survey. 53-75
Mads Dam: CTL* and ECTL* as Fragments of the Modal mu-Calculus. 77-96
Andreas Potthoff: Modulo-Counting Quantifiers Over Finite Trees. 97-112
Helmut Seidl: Finite Tree Automata with Cost Functions. 113-142

Doron Peled, Amir Pnueli: Proving Partial Order Properties. 143-182
Rajeev Alur, David L. Dill: A Theory of Timed Automata. 183-235
J. A. Gerhard, Mario Petrich: Unification in Free Distributive Lattices. 237-257
Vincent van Oostrom: Confluence by Decreasing Diagrams. 259-280
Laurent Regnier: Une équivalence sur les lambda-termes. 281-292