Advertisement

Specification and verification of TCSP systems by means of partial abstract data types

  • Ricardo Peña
  • Luis M. Alonso
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 352)

Abstract

A formal framework and a technique for the specification, refinement and correctness proving of parallel systems are presented. Processes are objects in the TCSP model and are specified by means of an auxiliary partial abstract data type. Part of the proofs are made in the abstract data type framework, so more powerful deductive methods can be used. Examples of specifications and of proving a refinement correct are included.

Keywords

Normal Form Liveness Property Partial Algebra Primitive Type Abstract Data Type 
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.

References

  1. [BHR 84]
    Brookes, S.D.; Hoare, C.A.R.; Roscoe, A.W. A Theory of Communicating Processes. Journal of the ACM, Vol. 31, No. 3, July 1984, pp.560–59CrossRefGoogle Scholar
  2. [BMPW 86]
    Broy, M.; Möller, B.; Pepper, P.; Wirsing, M., Algebraic implementation preserve program correctness. Science of Computer Programming 7 (1986) 35–37.CrossRefGoogle Scholar
  3. [BrKr 86]
    Broy, M.; Krieg-Brückner, B., PROSPECTRA training course, given at Alcatel-SESA, Madrid, dec. 1986Google Scholar
  4. [BrRo 85]
    Brookes, S.D.; Roscoe, A.W. An Improved Failures Model for Communicating Processes. LNCS No. 197, Springer_Verlag 1985, pp. 281–305Google Scholar
  5. [BrWi 82]
    Broy, M.; Wirsing, M., Partial abstract types. Acta Informatica 18 (1) (1982) 47–64.CrossRefGoogle Scholar
  6. [EhMa 85]
    Ehrig, H.; Mahr, B., Fundamentals of algebraic specification 1, EATCS Monographs on Theor. Comp. Sc., Springer Verlag, 1985.Google Scholar
  7. [EKMP 82]
    Ehrig, H.; Kreowski, H.-J.; Mahr, B.; Padawitz, P., Algebraic implementation of abstract data types, Theoret. Comp. Sc. 20 (1982) 209–263.Google Scholar
  8. [GrBr 87]
    Grünler, T.; Broy, M., Theoretical Foundation of Algebraic Specification and Implementation in PA nn dA-S. PROSPECTRA, ESPRIT project #390, report M.2.2.S1-R-1.1, Oct.1987.Google Scholar
  9. [Hen 86]
    Hennessy, M. Proving Systolic Systems Correct. ACM TOPLAS, Vol. 8, No. 3, July 1986, pp. 344–387CrossRefGoogle Scholar
  10. [Hoa 85]
    Hoare, C.A.R. Communicating Sequential Processes Prentice-Hall, 1985Google Scholar
  11. [HoJi 85]
    Hoare, C.A.R.; He Jifeng. Algebraic Specification and Proof of Properties of Communicating Sequential Processes. Technical Monograph PRG-52, Oxford University Comp. Lab., Nov. 1985Google Scholar
  12. [Mil 80]
    Milner, R. A Calculus of Communicating Systems. LNCS, No. 92, Springer-Verlag 1980Google Scholar
  13. [Nico 85]
    De Nicola, R. Two Complete Axiom Systems for a Theory of Communicating Sequential Processes. Information and Control, 64, 1985, pp. 136–172CrossRefGoogle Scholar
  14. [OlHo 86]
    Olderog, E.R.; Hoare, C.A.R. Specification-Oriented Semantics for Communicating Processes. Acta Informatica, Vol. 23, 1986, pp. 9–66Google Scholar
  15. [Old 86]
    Olderog, E.R. Process Theory: Semantics, Specification and Verification. LNCS No. 224, Springer-Verlag 1986Google Scholar
  16. [RoDa 86]
    Roscoe, A.W.; Dathi, Naiem. The pursuit of deadlock freedom. PRG-57, Oxford Univ. Computing Laboratory, Nov. 1986Google Scholar
  17. [WiBr 81]
    Wirsing, M.; Broy, M., An analysis of semantic models of algebraic specifications. In Broy, M., Schmidt, G. (eds.) Theoretical Foundations of Programming Methodology, International Summer School, Marktoberdorf, Aug. 1981, pp. 351–412Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Ricardo Peña
    • 1
  • Luis M. Alonso
    • 2
  1. 1.Department de Llenguatges i Sistemes InformàticsUniversitat Politècnica de CatalunyaBarcelonaSpain
  2. 2.Departmento de InformáticaUniversidad del Pais Vasco.San SebastiánSpain

Personalised recommendations