Author of the publication

Full Abstraction of a Real-Time Denotational Semantics for an Occam-like Language.

, , and . POPL, page 223-237. ACM Press, (1987)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Full Abstraction of a Real-Time Denotational Semantics for an Occam-like Language., , and . POPL, page 223-237. ACM Press, (1987)Dijkstra's Predicate Transformer, Non-Determinism, Recursion and Termination.. MFCS, volume 45 of Lecture Notes in Computer Science, page 472-481. Springer, (1976)Modular Completeness: Integrating the Reuse of Specified Software in Top-down Program Development., , , , and . FME, volume 1051 of Lecture Notes in Computer Science, page 595-608. Springer, (1996)A Proof Rule for Fair Termination of Guarded Commands, , , and . Inf. Control., 66 (1/2): 83-102 (July 1985)A Deductive Proof System for Multithreaded Java with Exceptions., , , and . Fundam. Informaticae, 82 (4): 391-463 (2008)A Proof System for Communicating Sequential Processes., , and . ACM Trans. Program. Lang. Syst., 2 (3): 359-385 (1980)Concurrency Verification: Introduction to Compositional and Noncompositional Methods, , , , , , and . Cambridge Tracts in Theoretical Computer Science Cambridge University Press, (2001)A Correctness Proof of a Distributed Minimum-Weight Spanning Tree Algorithm (extended abstract)., and . ICDCS, page 440-447. IEEE Computer Society, (1987)Semantics of Nondeterminism, Concurrency and Communication (Extended Abstract)., , and . MFCS, volume 64 of Lecture Notes in Computer Science, page 191-200. Springer, (1978)The Semantic Foundations of a Compositional Proof Method for Synchronously Communicating Processes., , and . MFCS, volume 1672 of Lecture Notes in Computer Science, page 343-353. Springer, (1999)