Jochen Burghardt (auth.), M. Dauchet, M. Nivat (eds.)354019021X, 9783540190219
Table of contents :
A tree pattern matching algorithm with reasonable space requirements….Pages 1-15
On the maximum path length of AVL trees….Pages 16-27
Decomposition trees: Structured graph representation and efficient algorithms….Pages 28-39
On counting and approximation….Pages 40-51
Parameter-reduction of higher level grammars….Pages 52-71
Analysis of dynamic algorithms in D.E.Knuth’s model….Pages 72-88
On completeness of narrowing strategies….Pages 89-101
Implementing term rewrite languages in Dactl….Pages 102-116
Unification in primal algebras….Pages 117-131
Algebraic specification with built-in domain constructions….Pages 132-148
Product and iteration of module specifications….Pages 149-164
Equational completion in order-sorted algebras extended abstract….Pages 165-184
Proving systolic arrays….Pages 185-199
Expressiveness bounds for completeness in trace-based network proof systems….Pages 200-214
Proof systems for Hennessy-Milner Logic with recursion….Pages 215-230
Regular automata and model checking….Pages 231-243
Interval logics and sequential transducers….Pages 244-257
A 2 CCS: A simple extension of CCS for handling atomic actions….Pages 258-270
Modelling statecharts behaviour in a fully abstract way….Pages 271-294
Directed hypergraphs: Data structures and applications….Pages 295-303
Reviews
There are no reviews yet.