CAAP '88

1. Front Matter

   PDF

2. A tree pattern matching algorithm with reasonable space requirements

   • Jochen Burghardt

   Pages 1-15

3. On the maximum path length of AVL trees

   • Rolf Klein, Derick Wood

   Pages 16-27

4. Decomposition trees: Structured graph representation and efficient algorithms

   • Clemens Lautemann

   Pages 28-39

5. On counting and approximation

   • Johannes Köbler, Uwe Schöning, Jacobo Toran

   Pages 40-51

6. Parameter-reduction of higher level grammars

   • Helmut Seidl

   Pages 52-71

7. Analysis of dynamic algorithms in D.E.Knuth's model

   • J. Françon, B. Randrianarimanana, R. Schott

   Pages 72-88

8. On completeness of narrowing strategies

   • Rachid Echahed

   Pages 89-101

9. Implementing term rewrite languages in Dactl

   • J. R. Kennaway

   Pages 102-116

10. Unification in primal algebras

    • Tobias Nipkow

    Pages 117-131

11. Algebraic specification with built-in domain constructions

    • Bernhard Möller, Andrzej Tarlecki, Martin Wirsing

    Pages 132-148

12. Product and iteration of module specifications

    • Francesco Parisi-Presicce

    Pages 149-164

13. Equational completion in order-sorted algebras extended abstract

    • Isabelle Gnaedig, Claude Kirchner, Hélène Kirchner

    Pages 165-184

14. Proving systolic arrays

    • E. Pascal Gribomont

    Pages 185-199

15. Expressiveness bounds for completeness in trace-based network proof systems

    • Jennifer Widom, Prakash Panangaden

    Pages 200-214

16. Proof systems for Hennessy-Milner Logic with recursion

    • Kim G. Larsen

    Pages 215-230

17. Regular automata and model checking

    • Z. Habasiński

    Pages 231-243

18. Interval logics and sequential transducers

    • Max Michel, Jean-Bernard Stefani

    Pages 244-257

19. A2CCS: A simple extension of CCS for handling atomic actions

    • Roberto Gorrieri, Sergio Marchetti, Ugo Montanari

    Pages 258-270

20. Modelling statecharts behaviour in a fully abstract way

    • C. Huizing, R. Gerth, W. P. de Roever

    Pages 271-294

This volume contains the proceedings of the 13th Colloquium on Trees in Algebra and Programming (CAAP '88), held in Nancy, March 21-24, 1988. The preceding 12 colloquia were held in France, Italy and Germany. CAAP '85 and CAAP '87 were integrated into the International Joint Conference on Theory and Practice of Software Development, TAPSOFT (see Lecture Notes in Computer Science volumes 185 and 249). As another effort to link theory and practice in computer science, CAAP '88 was held in conjunction with the European Symposium on Programming, ESOP '88 (see volume 300 of this Lecture Notes series). CAAP '88 is a conference in the area of program development and programming concepts but, following the tradition, is devoted to theoretical aspects, and especially to Trees, a basic structure of computer science. A wider range of topics in theoretical computer science is also covered. The papers are on word, tree or graph languages, with algorithmic or complexity studies, on abstract data types (another classical topic of CAAP) and/or term rewriting systems and on non-standard logics, and parallelism and concurrency.

• Algorithms
• Analysis
• Automat
• algorithm
• automata
• complexity
• computer
• computer science
• data structure
• data structures
• logic
• model checking
• programming
• term rewriting

Policies and ethics