TAPSOFT '87. Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 1987: Volume 1: ... Notes in Computer Science, 249, Band 249) - Softcover

Montanari, Ugo; Ehrig, Hartmut; Kowalski, Robert; Levi, Giorgio

Softcover

ISBN 10: 3540176608 ISBN 13: 9783540176602

Verlag: Springer, 2008

Inhaltsangabe

On the complexity of branching programs and decision trees for clique functions.- Average complexity of additive properties for multiway tries: A unified approach.- Longest common factor of two words.- An unification semi-algorithm for intersection type schemes.- Optimal run time optimization proved by a new look at abstract interpretations.- Transformation ordering.- On parametric algebraic specifications with clean error handling.- Toward formal development of programs from algebraic specifications: Implementations revisited.- Finite algebraic specifications of semicomputable data types.- On the semantics of concurrency: Partial orders and transition systems.- CCS without ?'s.- A fully observational model for infinite behaviours of communicating systems.- SMoLCS-driven concurrent calculi.- Parameterized horn clause specifications: Proof theory and correctness.- Partial composition and recursion of module specifications.- Efficient representation of taxonomies.- Applications of compactness in the Smyth powerdomain of streams.- Characterizing Kripke structures in temporal logic.- Dialogue with a proof system.- Induction principles formalized in the calculus of constructions.- Algebraic semantics.

Details zur Ausgabe

• Verlag: Springer
• Erscheinungsdatum: 2008
• Sprache: Englisch
• ISBN 10: 3540176608
• ISBN 13: 9783540176602
• Einband: Taschenbuch
• Anzahl der Seiten: 312
• Kontakt zum Hersteller: ProductSafety@springernature.com; ProductSafety@springernature.com; ; Poststr. 9; Darmstadt; 64293; Deutschland