Author(s): Ingo Wegener (auth.), Hartmut Ehrig, Robert Kowalski, Giorgio Levi, Ugo Montanari (eds.)
Series: Lecture Notes in Computer Science 249
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1987
Language: English
Pages: 294
Tags: Software Engineering; Logics and Meanings of Programs; Mathematical Logic and Formal Languages
On the complexity of branching programs and decision trees for clique functions....Pages 1-12
Average complexity of additive properties for multiway tries: A unified approach....Pages 13-25
Longest common factor of two words....Pages 26-36
An unification semi-algorithm for intersection type schemes....Pages 37-51
Optimal run time optimization proved by a new look at abstract interpretations....Pages 52-68
Transformation ordering....Pages 69-80
On parametric algebraic specifications with clean error handling....Pages 81-95
Toward formal development of programs from algebraic specifications: Implementations revisited....Pages 96-110
Finite algebraic specifications of semicomputable data types....Pages 111-122
On the semantics of concurrency: Partial orders and transition systems....Pages 123-137
CCS without τ's....Pages 138-152
A fully observational model for infinite behaviours of communicating systems....Pages 153-168
SMoLCS-driven concurrent calculi....Pages 169-201
Parameterized horn clause specifications: Proof theory and correctness....Pages 202-216
Partial composition and recursion of module specifications....Pages 217-231
Efficient representation of taxonomies....Pages 232-240
Applications of compactness in the Smyth powerdomain of streams....Pages 241-255
Characterizing Kripke structures in temporal logic....Pages 256-270
Dialogue with a proof system....Pages 271-275
Induction principles formalized in the calculus of constructions....Pages 276-286
Algebraic semantics....Pages 287-287
