论文信息 - Fairness Assumptions for CSP in a Temporal Logic Framework

Fairness Assumptions for CSP in a Temporal Logic Framework

Six fairness assumptions for the repetitive construct * [ ... Db,t , c,e -+ S,t D ... ] in a subset of CSP are given and classified with respect to the programs they cause to terminate. A total correctness proof system for the subset of CSP is given, incorporating the different fair ness assumptions.

Willem P. de Roever | Ruurd Kuiper | R. Kuiper | W. P. Roever

[1] Krzysztof R. Apt,et al. Formal Justification of a Proof System for Communicating Sequential Processes , 1983, JACM.

[2] Leslie Lamport,et al. Proving Liveness Properties of Concurrent Programs , 1982, TOPL.

[3] A. Pnueli. The Temporal Semantics of Concurrent Programs , 1979, Theor. Comput. Sci..

[4] Saharon Shelah,et al. On the temporal analysis of fairness , 1980, POPL '80.

[5] C. A. R. Hoare,et al. Communicating sequential processes , 1978, CACM.

[6] Edsger W. Dijkstra,et al. Guarded commands, nondeterminacy and formal derivation of programs , 1975, Commun. ACM.

[7] Susan S. Owicki,et al. Axiomatic Proof Techniques for Parallel Programs , 1975, Outstanding Dissertations in the Computer Sciences.