Advertisement

An integrated algebraic approach to the specification of data types, processes and objects

  • E. Astesiano
  • A. Giovini
  • G. Reggio
  • E. Zucca
Part I Algebraic Specification
Part of the Lecture Notes in Computer Science book series (LNCS, volume 394)

Keywords

Transition System Object System Label Transition System Concurrent System Partial Algebra 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. LNCS.
    n. x stands for Lecture Notes in Computer Science, Springer-Verlag, Berlin, n. x.Google Scholar
  2. [AGR1]
    E. Astesiano, A. Giovini, G. Reggio, Generalized Bisimulation in Relational Specifications, in Proc. STACS '88, LNCS n. 294, pp. 207–226, 1988.Google Scholar
  3. [AGR2]
    E. Astesiano, A. Giovini, G. Reggio, Data in concurrent environment, to appear in Proc. Concurrency '88, (F. Vogt ed.), LNCS n. ..., 1988.Google Scholar
  4. [AMRW]
    E. Astesiano, G. F. Mascari, G. Reggio, M. Wirsing, On the Parameterized Algebraic Specification of Concurrent Systems, Proc. TAPSOFT Conference, Vol.1, LNCS n. 186, pp. 342–358, 1985.Google Scholar
  5. [AR1]
    E. Astesiano, G. Reggio, An Outline of the SMoLCS Methodology, in Mathematical Models for the Semantics of Parallelism, Proc. Advanced School on Mathematical Models of Parallelism, (M. Venturini Zilli ed.), LNCS n. 280, pp. 81–113, 1987.Google Scholar
  6. [AR2]
    E. Astesiano, G. Reggio, SMoLCS-Driven Concurrent Calculi, (invited paper) in Proc. TAPSOFT'87, vol.1, LNCS n. 249, pp. 169–201, 1987.Google Scholar
  7. [AR3]
    E. Astesiano, G. Reggio, Direct Semantics for Concurrent Languages in the SMoLCS Approach, IBM Journal of Research and Development, vol. 31, n. 5, pp. 512–534, 1987.Google Scholar
  8. [ARW]
    E. Astesiano, G. Reggio, M. Wirsing, Relational Specifications and Observational Semantics, in Proc. MFCS'86 (Symposium on Mathematical Foundations of Computer Science, Bratislava), LNCS n. 233, pp. 209–217, 1986.Google Scholar
  9. [B]
    M. Broy, Views of Queues, technical report Universität Passau, MIP-8704, February 1987.Google Scholar
  10. [BW]
    M. Broy, M. Wirsing, Partial abstract types, Acta Informatica 18, 47–64, 1982.Google Scholar
  11. [C]
    L. Cardelli, A semantics of multiple inheritance, in Semantics of Data Types, proc. of International Symposium Sophia-Antipolis (G. Kahn, D. B. MacQueen, G. Plotkin editors), LNCS n. 173, pp. 51–68, 1984.Google Scholar
  12. [CRAI-DDC]
    E. Astesiano, C. Bendix Nielsen, N. Botta, A. Fantechi, A. Giovini, P. Inverardi, E. Karlsen, F. Mazzanti, J. Storbank Pedersen, G. Reggio, E. Zucca, The Draft Formal Definition of Ada, Deliverable of the CEC MAP project: The Draft Formal Definition of ANSI/STD 1815A Ada, 1986.Google Scholar
  13. [GM]
    J. A. Goguen, J. Meseguer, Models and equality for logical Programming, in Proc. TAPSOFT'87, vol.2, LNCS n. 249, pp. 1, 22, 1987.Google Scholar
  14. [GR]
    A. Goldberg, D. Robson, Smalltalk-80 The language and its implementation, Addison-Wesley, 1985.Google Scholar
  15. [GV]
    R. van Glabbeek, F. Vaandrager, Curious Queues, in: Proc. METEOR 1987 Workshop, (M. Wirsing ed.), LNCS, 1988.Google Scholar
  16. [HJ]
    C. A. R. Hoare, H. Jeifeng, Algebraic specification and proof of properties of a mail service, in Program Specification and Transformation (Proc. of IFIP TC2/WG 2.1 Working Conference on Program Specification and Transformation, Bad Tölz, 1986), North-Holland, 1987.Google Scholar
  17. [KP]
    S. Kaplan, A. Pnueli, Specification and Implementation of Concurrently Accessed Data Structures: an Abstract Data Type Approach, in: Proc. STACS '87 (F. J. Brandenburg, G. Vidal-Naquet, M. Wirsing eds.), LNCS n. 247, 1987.Google Scholar
  18. [M1]
    R. Milner, A calculus of communicating systems, LNCS n. 92, 1980.Google Scholar
  19. [M2]
    R. Milner, Calculi for synchrony and asynchrony, TCS 25, 267–310, 1983.CrossRefGoogle Scholar
  20. [Me]
    B. Meyer, Eiffel: Programming for reusability and extendibility, SIGPLAN Notices, V. 22 #2, February 1987.Google Scholar
  21. [Pa]
    D. Park, Concurrency and Automata on Infinite Sequences, in Proc. 5th GI Conference LNCS n. 104, 1981.Google Scholar
  22. [Pl]
    G. Plotkin, A structural approach to operational semantics, Lecture notes, Aarhus University, 1981.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • E. Astesiano
    • 1
  • A. Giovini
    • 1
  • G. Reggio
    • 1
  • E. Zucca
    • 1
  1. 1.Department of MathematicsUniversity of GenovaItaly

Personalised recommendations