Table of Contents

A tree pattern matching algorithm with reasonable space requirements.- On the maximum path length of AVL trees.- Decomposition trees: Structured graph representation and efficient algorithms.- On counting and approximation.- Parameter-reduction of higher level grammars.- Analysis of dynamic algorithms in D.E.Knuth's model.- On completeness of narrowing strategies.- Implementing term rewrite languages in Dactl.- Unification in primal algebras.- Algebraic specification with built-in domain constructions.- Product and iteration of module specifications.- Equational completion in order-sorted algebras extended abstract.- Proving systolic arrays.- Expressiveness bounds for completeness in trace-based network proof systems.- Proof systems for Hennessy-Milner Logic with recursion.- Regular automata and model checking.- Interval logics and sequential transducers.- A2CCS: A simple extension of CCS for handling atomic actions.- Modelling statecharts behaviour in a fully abstract way.- Directed hypergraphs: Data structures and applications.

Promotional Information

Springer Book Archives