Hartmut Ehrig, Robert A. Kowalski, Giorgio Levi, Ugo Montanari
Proceedings of the Second International Joint Conference on Theory and Practice of Software Development, Volume 1: Colloquium on Trees in Algebra and Programming
TAPSOFT, Vol.1: CAAP, 1987.

@proceedings{CAAP-1987,
	doi           = "10.1007/3-540-17660-8",
	editor        = "Hartmut Ehrig and Robert A. Kowalski and Giorgio Levi and Ugo Montanari",
	isbn          = "3-540-17660-8",
	publisher     = "{Springer}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Second International Joint Conference on Theory and Practice of Software Development, Volume 1: Colloquium on Trees in Algebra and Programming}",
	volume        = 249,
	year          = 1987,
}

Contents (17 items)

CAAP-1987-Wegener #branch #clique #complexity #on the #source code

On the Complexity of Branching Programs and Decision Trees for Clique Functions (IW), pp. 1–12.

CAAP-1987-Szpankowski #approach #complexity #multi

Average Complexity of Additive Properties for Multiway Tries: A Unified Approach (Extended Abstract) (WS), pp. 13–25.

CAAP-1987-Crochemore #word

Longest Common Factor of Two Words (MC), pp. 26–36.

CAAP-1987-Rocca #unification

An Unification Semi-Algorithm for Intersection Type Schemes (SRDR), pp. 37–51.

CAAP-1987-Steffen #abstract interpretation #optimisation #runtime

Optimal Run Time Optimization Proved by a New Look at Abstract Interpretation (BS), pp. 52–68.

CAAP-1987-BellegardeL

Transformation Ordering (FB, PL), pp. 69–80.

CAAP-1987-Gogolla #algebra #fault #on the #parametricity #specification

On Parametric Algebraic Specifications with Clean Error Handling (MG), pp. 81–95.

CAAP-1987-SannellaT #algebra #development #implementation #source code #specification #towards

Toward Formal Development of Programs from Algebraic Specifications: Implementations Revisited (Extended Abstract) (DS, AT), pp. 96–110.

CAAP-1987-MarongiuT #algebra #data type #finite #specification

Finite Algebraic Specifications of Semicomputable Data Types (GM, ST), pp. 111–122.

CAAP-1987-BoudolC #concurrent #on the #partial order #semantics

On the Semantics of Concurrency: Partial Orders and Transition Systems (GB, IC), pp. 123–137.

CAAP-1987-NicolaH

CCS without tau's (RDN, MH), pp. 138–152.

CAAP-1987-DarondeauG #behaviour #communication #infinity

A Fullt Observational Model for Infinite Behaviours of Communicating Systems (PD, BG), pp. 153–168.

CAAP-1987-NavarroO #correctness #horn clause #proving #specification

Parameterized Horn Clause Specifications: Proof Theory and Correctness (MN, FO), pp. 202–216.

CAAP-1987-Parisi-Presicce #composition #recursion #specification

Partial Composition and Recursion of Module Specifications (FPP), pp. 217–231.

CAAP-1987-GambosiNT #performance #representation #taxonomy

Efficient Representation of Taxonomies (GG, JN, MT), pp. 232–240.

CAAP-1987-MeyerV

Applications of Compactness in the Smyth Powerdomain of Streams (Extended Abstract) (JJCM, EPdV), pp. 241–255.

CAAP-1987-BrowneCG #logic

Characterizing Kripke Structures in Temporal Logic (MCB, EMC, OG), pp. 256–270.