13. CAAP 1988: Nancy, France

Max Dauchet, Maurice Nivat (Eds.): CAAP '88, 13th Colloquium on Trees in Algebra and Programming, Nancy, France, March 21-24, 1988, Proceedings. Lecture Notes in Computer Science 299 Springer 1988, ISBN 3-540-19021-X BibTeX

@proceedings{DBLP:conf/caap/1988,
  editor    = {Max Dauchet and
               Maurice Nivat},
  title     = {CAAP '88, 13th Colloquium on Trees in Algebra and Programming,
               Nancy, France, March 21-24, 1988, Proceedings},
  booktitle = {CAAP},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {299},
  year      = {1988},
  isbn      = {3-540-19021-X},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Tree Algorithms

Jochen Burghardt: A Tree Pattern Matching Algorithm with Reasonable Space Requirements. 1-15 BibTeX
Rolf Klein, Derick Wood: On the Maximum Path Length of AVL Trees. 16-27 BibTeX
Clemens Lautemann: Decomposition Trees: Structured Graph Representation and Efficient Algorithms. 28-39 BibTeX

Complexity

Johannes Köbler, Uwe Schöning, Jacobo Torán: On Counting and Approximation. 40-51 BibTeX
Helmut Seidl: Parameter-Reduction of Higher Level Grammars (Extended Abstract). 52-71 BibTeX
Jean Françon, B. Randrianarimanana, René Schott: Analysis of Dynamic Algorithms in D. E. Knuth's Model. 72-88 BibTeX

Rewriting

Rachid Echahed: On Comleteness of Narrowing Strategies. 89-101 BibTeX
Richard Kennaway: Implementing Term Rewritin Languages in Dactl. 102-116 BibTeX
Tobias Nipkow: Unification in Primal Algebras. 117-131 BibTeX

Algebraic Specifications

Bernhard Möller, Andrzej Tarlecki, Martin Wirsing: Algebraic Specification with Built-in Domain Constructions. 132-148 BibTeX
Francesco Parisi-Presicce: Product and Iteration of Module Specifications. 149-164 BibTeX
Isabelle Gnaedig, Claude Kirchner, Hélène Kirchner: Equational Completion in Order-Sorted Algebras (Extended Abstract). 165-184 BibTeX

Parallelism and Concurrency

E. Pascal Gribomont: Proving Systolic Arrays. 185-199 BibTeX
Jennifer Widom, Prakash Panagaden: Expressiveness Bounds for Completness in Trace-Based Network Proof Systems. 200-214 BibTeX
Kim Guldstrand Larsen: Proof System for Hennessy-Milner Logic with Recursion. 215-230 BibTeX
Z. Habasinski: Regular Automata and Model Checking. 231-243 BibTeX
Max Michel, Jean-Bernard Stefani: Interval Logics and Sequential Transducers. 244-257 BibTeX
Roberto Gorrieri, Sergio Marchetti, Ugo Montanari: A²CCS: A Simple Extension of CCS for Handling Atomic Actions. 258-270 BibTeX
Cornelis Huizing, Rob Gerth, Willem P. de Roever: Modeling Statecharts Behaviour in a Fully Abstract Way. 271-294 BibTeX

Invited Lectures

Giorgio Ausiello: Directed Hypergraphs: Data Structures and Applications. 295-303 BibTeX