From post

Formal Semantics for Ward & Mellor's Transformation Schemas and the Specification of Faul Tolerant Systems.

, , , и . EDCC, том 852 из Lecture Notes in Computer Science, стр. 59-76. Springer, (1994)

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.

 

Другие публикации лиц с тем же именем

Full Abstraction of a Real-Time Denotational Semantics for an Occam-like Language., , и . POPL, стр. 223-237. ACM Press, (1987)Dijkstra's Predicate Transformer, Non-Determinism, Recursion and Termination.. MFCS, том 45 из Lecture Notes in Computer Science, стр. 472-481. Springer, (1976)A Proof Rule for Fair Termination of Guarded Commands, , , и . Inf. Control., 66 (1/2): 83-102 (июля 1985)Modular Completeness: Integrating the Reuse of Specified Software in Top-down Program Development., , , , и . FME, том 1051 из Lecture Notes in Computer Science, стр. 595-608. Springer, (1996)The Quest Goes on: A Survey of Proofsystems for Partial Correctness of CSP., и . Current Trends in Concurrency, том 224 из Lecture Notes in Computer Science, Springer, (1986)A Deductive Proof System for Multithreaded Java with Exceptions., , , и . Fundam. Informaticae, 82 (4): 391-463 (2008)Concurrency Verification: Introduction to Compositional and Noncompositional Methods, , , , , , и . Cambridge Tracts in Theoretical Computer Science Cambridge University Press, (2001)A Correctness Proof of a Distributed Minimum-Weight Spanning Tree Algorithm (extended abstract)., и . ICDCS, стр. 440-447. IEEE Computer Society, (1987)A Proof System for Communicating Sequential Processes., , и . ACM Trans. Program. Lang. Syst., 2 (3): 359-385 (1980)Designing Distributed Algorithms by Means of Formal Sequentially Phased Reasoning (Extended Abstract)., и . WDAG, том 392 из Lecture Notes in Computer Science, стр. 242-253. Springer, (1989)