Advertisement

On the semantics of fair parallelism

  • David Park
Parallellism & Non-Determinism
Part of the Lecture Notes in Computer Science book series (LNCS, volume 86)

Keywords

Relational Semantic Infinite Sequence Relation Algebra Fixpoint Property Recursive Program 
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. [1]
    Arnold, A., Nivat, M.: Metric interpretations of infinite trees and semantics of nondeterministic recursive programs. Rapport I.T.-3-78. Equipe Lilloise d'Informatique Theorique, 1978.Google Scholar
  2. [2]
    de Bakker, J.W.: Semantics and termination of nondeterministic recursive programs. pp 435–477 in Automata, Languages and Programming, ed. Michaelson, Milner, Edinburgh University Press, 1976.Google Scholar
  3. [3]
    de Bakker, J.W., de Roever, W.P.: A calculus for recursive program schemes, pp. 167–196 in Automata, Languages and Programming, ed. Nivat, North Holland 1973.Google Scholar
  4. [4]
    Dijkstra, E.W., A Discipline of Programming. Prentice-Hall, 1976.Google Scholar
  5. [5]
    Plotkin, G., A powerdomain construction. 452–487, SIAM J. Comp. 5 (1976).CrossRefGoogle Scholar
  6. [6]
    Hitchcock, P., Park, D., Induction rules and termination proofs. pp. 225–251 in Automata, Languages and Programming, ed. Nivat, North Holland 1973.Google Scholar
  7. [7]
    de Roever, W.P., Dijkstra's predicate transformer, nondeterminism, recursion and termination, in Mathematical Foundations of Computer Science, Springer Lecture Notes 45, 1976.Google Scholar
  8. [8]
    Smyth, M., Power domains. 23–26 J. Comp. Sys. Sci. 16 (1978)CrossRefGoogle Scholar
  9. [9]
    Tiuryn, J., Continuity problems in the power-set algebra of infinite trees. (presented at 4e Colloque de Lille, 1979), Warsaw, 1979.Google Scholar
  10. [10]
    Wadge, W.W.: An extensional treatment of dataflow deadlock. 285–299 in Semantics of Concurrent Computation, Springer Lecture Notes 70, 1979.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • David Park
    • 1
  1. 1.Department of Computer ScienceUniversity of WarwickCoventryEngland

Personalised recommendations