Skip to main content

Specification-Oriented Programming in TCSP

— Preliminary Version —

  • Conference paper
Logics and Models of Concurrent Systems

Part of the book series: NATO ASI Series ((NATO ASI F,volume 13))

Abstract

We wish to study computational systems at two levels of abstraction: the level of specification and the level of program. A specification describes what one wishes to achieve, i.e. the properties or semantics of the desired system. A program describes how this system can be constructed, i.e. expressed or implemented in the restricted syntax of a specific programming language.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.J.R. Back, Correctness preserving program refinements: proof theory and applications, Mathematical Centre Tracts 131 (Mathematical Centre, Amsterdam, 1980).

    Google Scholar 

  2. F.L. Bauer et al., The Munich project CIP, volume I: the wide spectrum language 84, Tech. Rep., Institut für Informatik, Tech. Univ. München, December 1983.

    Google Scholar 

  3. J.A. Bergstra, J.W. Klop, J.V. Tucker, Algebraic tools for system construction, in: E.M. Clarke, D. Kozen (Eds.), Logics of Programs, Lecture Notes in Computer Science 164 (Springer, Berlin, 1984).

    Google Scholar 

  4. S.D. Brookes, C.A.R. Hoare, A.W. Roscoe, A theory of communicating sequential processes, J. ACM 31 (1984) 560–599.

    Article  MATH  MathSciNet  Google Scholar 

  5. R.M. Burstall, J. Darlington, A transformation system for developing recursive programs, J. ACM 24 (1977) 44–67.

    Article  MATH  MathSciNet  Google Scholar 

  6. E.A. Emerson, E.M. Clarke, Using branching time temporal logic to synthesize synchronization skeletons, Science of Computer Programming 2 (1982, pubi. 1983) 241–266.

    Article  MATH  Google Scholar 

  7. E.C.R. Hehner, Predicative programming, part I and II, Comm. ACM 27 (1984) 134–151.

    Article  MATH  MathSciNet  Google Scholar 

  8. C.A.R. Hoare, A calculus of total correctness for communicating processes, Science of Computer Programming 1 (1981) 49–72.

    Article  MATH  MathSciNet  Google Scholar 

  9. C.A.R. Hoare, Specifications, programs and implementations, Tech. Monograph PRG-29, Oxford Univ. Progr. Research Group, 1982

    Google Scholar 

  10. R.B. Kieburtz, J. Schultis, Transformations of FP programs, in: Proc. ACM Conf. on Functional Progr. Languages and Comp. Architectures, Portsmouth, New Hampshire (1981) 41–57.

    Google Scholar 

  11. L. Lamport, What good is temporal logic?, in: R.E.A. Mason (Ed.), IFIP Information Processing 83 (North Holland, Amsterdam, 1983 657–668.

    Google Scholar 

  12. Z. Manna, R. Waldinger, A deductive approach to program synthesis, ACM TOPLAS 2 (1980) 90–121.

    Article  MATH  Google Scholar 

  13. Z. Manna, P. Wolper, Synthesis of communcating processes from temporal logic specifications, ACM TOPLAS 6 (1984) 68–93.

    Article  MATH  Google Scholar 

  14. R. Milner, A calculus of communicating systems, Lecture notes in Computer Science 92 (Springer, Berlin, 1980).

    Google Scholar 

  15. R. de Nicola, M. Hennessy, Testing equivalences for processes, Internal Report CSR-123–82, Dept. of Computer Science, Univ. of Edinburgh, 1982 (to appear in Theoret. Computer Science).

    Google Scholar 

  16. E.-R. Olderog, C.A.R. Hoare, Specification-oriented semantics for communicating processes, Tech. Monograph PRG-37, Oxford Univ., Progr. Research Group, 1984 (a preliminary version appeared in: J. Diaz (Ed.), Proc. 10th Coll. Automata, Languages and Programming, Lecture Notes in Computer Science 154 (Springer, Berlin, 1983) 561–572).

    Google Scholar 

  17. P. Robert, J.-P. Verjus, Toward autonomous descriptions of synchronization modules, in: B Gilchrist (Ed.), IFIP Information Processing 77 (North Holland, Amsterdam 1977) 981–986.

    Google Scholar 

  18. W.S. Scherlis, D.S. Scott, First steps towards inferential programming, in: R.E.A. Mason (Ed.), IFIP Information Processing 83 (North Holland, Amsterdam 1983) 199–212.

    Google Scholar 

  19. G. Winskel, A new definition of morphism on Petri nets, in: M. Fontet, K. Mehlhorn (Eds.), 1st Symp. on Theoret. Aspects of Computer Science, Lecture Notes in Computer Science 166 (Springer, Berlin, 1984) 140–150.

    Google Scholar 

  20. E. Wong, K. Youssefi, Decomposition–a strategy for query processing, ACM TODS 1 (1976) 223–241.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Olderog, ER. (1985). Specification-Oriented Programming in TCSP. In: Apt, K.R. (eds) Logics and Models of Concurrent Systems. NATO ASI Series, vol 13. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-82453-1_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-82453-1_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-82455-5

  • Online ISBN: 978-3-642-82453-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics