Skip to main content
SpringerLink
Log in
Book cover

TAPSOFT '87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 1987

Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming (CAAP '87)

  • Conference proceedings
  • © 1987

Overview

Editors:
  1. Hartmut Ehrig
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Robert Kowalski
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Giorgio Levi
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Ugo Montanari
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 249)

Included in the following conference series:

Conference proceedings info: CAAP 1987.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 49.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (21 papers)

  1. Front Matter

    Download chapter PDF

  2. On the complexity of branching programs and decision trees for clique functions

    • Ingo Wegener
    Pages 1-12

  3. Average complexity of additive properties for multiway tries: A unified approach

    • Wojciech Szpankowski
    Pages 13-25

  4. Longest common factor of two words

    • Maxime Crochemore
    Pages 26-36

  5. An unification semi-algorithm for intersection type schemes

    • Simona Ronchi Della Rocca
    Pages 37-51

  6. Optimal run time optimization proved by a new look at abstract interpretations

    • Bernhard Steffen
    Pages 52-68

  7. Transformation ordering

    • F. Bellegarde, P. Lescanne
    Pages 69-80

  8. On parametric algebraic specifications with clean error handling

    • Martin Gogolla
    Pages 81-95

  9. Toward formal development of programs from algebraic specifications: Implementations revisited

    • Donald Sannella, Andrzej Tarlecki
    Pages 96-110

  10. Finite algebraic specifications of semicomputable data types

    • G. Marongiu, S. Tulipani
    Pages 111-122

  11. On the semantics of concurrency: Partial orders and transition systems

    • G. Boudol, I. Castellani
    Pages 123-137

  12. CCS without Ï„'s

    • Rocco De Nicola, Matthew Hennessy
    Pages 138-152

  13. A fully observational model for infinite behaviours of communicating systems

    • Ph. Darondeau, B. Gamatie
    Pages 153-168

  14. SMoLCS-driven concurrent calculi

    • Egidio Astesiano, Gianna Reggio
    Pages 169-201

  15. Parameterized horn clause specifications: Proof theory and correctness

    • M. Navarro, F. Orejas
    Pages 202-216

  16. Partial composition and recursion of module specifications

    • Francesco Parisi-Presicce
    Pages 217-231

  17. Efficient representation of taxonomies

    • G. Gambosi, J. NeÅ¡etÅ™il, M. Talamo
    Pages 232-240

  18. Applications of compactness in the Smyth powerdomain of streams

    • J. -J. Ch. Meyer, E. P. de Vink
    Pages 241-255

  19. Characterizing Kripke structures in temporal logic

    • M. C. Browne, E. M. Clarke, O. Grümberg
    Pages 256-270

  20. Dialogue with a proof system

    • Robin Milner
    Pages 271-275
Back to top

Other volumes

  1. TAPSOFT '87

Keywords

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation