Access the full text.
Sign up today, get DeepDyve free for 14 days.
B. Jonsson (1985)
A model and proof system for asynchronous networks
S. Brookes, A. Roscoe (1984)
An Improved Failures Model for Communicating Processes
J. Zwiers, W. Roever, P. Boas (1985)
Compositionality and Concurrent Networks: Soundness and Completeness of a Proofsystem
B. Alpern, F. Schneider (1984)
Defining LivenessInf. Process. Lett., 21
J. Misra, K. Chandy, Todd Smith (1982)
Proving safety and liveness of communicating processes with examples
C. Hoare (1981)
A Calculus of Total Correctness for Communicating ProcessesSci. Comput. Program., 1
N. Soundararajan (1986)
Total correctness of CSP programsActa Informatica, 23
H. Enderton (1972)
A mathematical introduction to logic
J. Misra, K. Chandy (1981)
Proofs of Networks of ProcessesIEEE Transactions on Software Engineering, SE-7
A Pnueli (1984)
Current trends in concurrency
P Pandya (1990)
Stepwise refinement of distributed systems
N. Soundararajan (1983)
Correctness Proofs of CSP ProgramsTheor. Comput. Sci., 24
N. Francez, A. Pnueli (1978)
A proof method for cyclic programsActa Informatica, 9
Rahim Ramezanian (1978)
Communicating sequential processesCommun. ACM, 21
P. Pandya (1989)
Some Comments on the Assumption-Commitment Framework for Compositional Verification of Distributed Programs
WP Roever (1985)
Proc of the IFIP conference: the role of abstract models in computer science, Vienna
A. Pnueli (1986)
Applications of Temporal Logic to the Specification and Verification of Reactive Systems: A Survey of Current Trends
Van Nguyen, A. Demers, D. Gries, S. Owicki (1985)
A model and temporal proof system for networks of processesDistributed Computing, 1
CAR Hoare (1981)
A calculus for the total correctness of communicating processesSci Comp Progr, 1
K. Apt, N. Francez, W. Roever (1980)
A Proof System for Communicating Sequential ProcessesACM Transactions on Programming Languages and Systems (TOPLAS), 2
J. Zwiers (1989)
Compositionality, Concurrency and Partial Correctness, 321
J. Widom, D. Gries, F. Schneider (1987)
Completeness and incompleteness of trace-based network proof systems
B. Alpern, A. Demers, F. Schneider (1986)
Safety Without StutteringInf. Process. Lett., 23
Cliff Jones (1983)
Specification and Design of (Parallel) Programs
S. Owicki (1975)
Axiomatic Proof Techniques for Parallel Programs
G. Plotkin (1982)
An Operational Semantics for CSP.
L. Lamport (1980)
"Sometime" is sometimes "not never": on the temporal logic of programs
D. Gries (1981)
The Science of Programming
G. Levin, D. Gries (1981)
A proof technique for communicating sequential processesActa Informatica, 15
This paper describes a compositional proof system called P-A logic for establishing weak total correctness and weak divergence correctness of CSP-like distributed programs with synchronous and asynchronous communication. Each process in a network is specified using logical assertions in terms of a presuppositionPre and an affirmationAff as a triple {Pre}S{Aff}. For purely sequential programs, these triples reduce to the familiar Hoare triples. In distributed programs, P-A triples allow the behaviour of a process to be specified in the context of assumptions about its communications with the other processes in the network. Safety properties of process communications, and progress properties such as finiteness and freedom from divergence can be proved. An extension of P-A logic allowing proof of deadlock freedom is outlined. Finally, proof rules for deriving some liveness properties of a program from its P-A logic specification are discussed; these properties have the form “Q untilR”, whereQ, R are assertions over communication traces. Other liveness properties may be derived from these properties using the rules of temporal logic.
Distributed Computing – Springer Journals
Published: Jan 14, 2006
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.