On the semantics of fair parallelism

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 86 LNCS, Issue , 1980, Pages 504-526

  Park, David ^a  

^a UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 2542527603     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-10007-5_47     Document Type: Conference Paper

References (10)

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.
2. de Bakker, J.W.: Semantics and termination of nondeterministic recursive programs, pp 435-477 in Automata, Languages and Programmingy ed. Michaelson, Milner, Edinburgh University Press, 1976.
3. de Bakker, J.W., de Roever, W.P.: A calculus for recursive program schemes, pp. 167-196 in Automata, Languages and Programning, ed. Nivat, North Holland 1973.
4. Dijkstra, E.W., A Discipline of Programming. Prentice-Hall, 1976.
5. Plotkin, G., A powerdomain construction. 452-487, SIAM J. Comp. 5, (1976).
6. Hitchcock, P., Park, D., Induction rules and termination proofs, pp. 225-251 in Automata, Languages and Programming, ed. Nivat, North Holland 1973.
7. de Roever, W.P., Dijkstra’s predicate transformer, nondeterminism, recursion and termination, in Mathematical Foundations of Computer Science, Springer Lecture Notes 45, 1976.
8. Smyth, M., Power domains. 23-26 J. Comp. Sys. Sci. 16 (1978)
9. Tiuryn, J., Continuity problems in the power-set algebra of infinite trees, (presented at 4e Colloque de Lille, 1979), Warsaw, 1979.
10. Wadge, W.W.: An extensional treatment of dataflow deadlock. 285-299 in Semantics of Concurrent Computation, Springer Lecture Notes 70, 1979.