Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Semantics of nondeterminism, concurrency and communication

Extended abstract, November 1977

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1978 (MFCS 1978)

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

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hoare, C.A.R., Communicating Sequential Processes, Queen's Univ., Belfast, 1976, submitted to CACM.

    Google Scholar 

  2. Milne, Robert, The semantics of one version of CSP, notes distributed at the Aarhus Workshop on Semantics of Concurrent Programming, June 1977.

    Google Scholar 

  3. Hoare, C.A.R., A relational trace-oriented Semantics for Communicating Sequential Processes, ibid.

    Google Scholar 

  4. Milner, Robin, & G. Milne, Concurrent Processes and their Syntax, Univ. of Edinburgh, 1977.

    Google Scholar 

  5. Kahn, G., The Semantics of a Simple Language for parallel programming, IFIP, 1974.

    Google Scholar 

  6. Clint, M., Program proving: Coroutines, Acta Informatica, Vol. 2, No. 1, 1973, 50–63.

    Article  Google Scholar 

  7. Owicki, Susan, and Gries, David, An axiomatic proof technique for parallel programs I, Acta Informatica 6, 319–340, 1976.

    Article  Google Scholar 

  8. Dijkstra, Edsger W., A discipline of programming, Prentice Hall, Burroughs-Nuenen, 1976.

    Google Scholar 

  9. Dijkstra, Edsger W., et al. An elephant inspired by the Dutch National Flag, EWD 608; see also EWD 607; Burroughs-Nuenen, 1977.

    Google Scholar 

  10. Egli, Herbert, A mathematical model for nondeterministic computations, Technological University, Zurich, 1975.

    Google Scholar 

  11. Plotkin, Gordon D., A power domain construction, Siam J. Comput., Vol. 5, No. 3, September 1976.

    Google Scholar 

  12. Smyth, M., Effectively given domains, Univ. of Warwick, 1976.

    Google Scholar 

  13. DeBakker, J.W., Semantics and termination of nondeterministic recursive programs, Proc. 3rd coll. Automata, Languages and Programming, Edinb. Univ. Press, 1976.

    Google Scholar 

  14. Goguen, J. Abstract Errors for Abstract Data Types, Proc. IFIP Working Conference on Formal Description of Programming Concepts, 31 July to August 1977, New Brunswick.

    Google Scholar 

  15. Milner, Robin, Two operations on trees, in same as (2).

    Google Scholar 

  16. Scott, D. and Strachey, C., Towards a mathematical semantics for computer languages, Proc. Symp. on Computers and Automata, Microwave Research Institute 21, 1971.

    Google Scholar 

  17. Scott, D. Outline of mathematical theory of computation, Proc. 4th Princeton Conf. on Info. Sci. and Sys., 1970.

    Google Scholar 

  18. Smyth, M. Power domains, Dept. of Comp. Sci., Univ. of Warwick, 1976.

    Google Scholar 

  19. Milner, R. Processes: A mathematical model of computing agents, Logic Colloquium 1973, N. Holland, Amsterdam, 1973.

    Google Scholar 

  20. Brinch Hansen, P. The programming language Concurrent Pascal, IEEE Trans. on Software Eng. 1, 2, pp. 199–207, 1975.

    Google Scholar 

  21. Hoare, C.A.R. Monitors: An operating systems structuring concept, CACM 17, 10, pp. 549–557, 1974.

    Google Scholar 

  22. Francez, N. The analysis of cyclic programs, Ph.D. thesis, Dept. of Applied Math., the Weizman Institute of Science, Rehorat, Israel, July 1976. (To appear in Acta Informatica)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

J. Winkowski

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Francez, N., Hoare, C.A.R., de Roever, W.P. (1978). Semantics of nondeterminism, concurrency and communication. In: Winkowski, J. (eds) Mathematical Foundations of Computer Science 1978. MFCS 1978. Lecture Notes in Computer Science, vol 64. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08921-7_67

Download citation

  • DOI: https://doi.org/10.1007/3-540-08921-7_67

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08921-6

  • Online ISBN: 978-3-540-35757-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics