𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Finding the correctness proof of a concurrent program

✍ Scribed by E.W. Dijkstra

Publisher
Elsevier Science
Year
1978
Weight
521 KB
Volume
81
Category
Article
ISSN
1385-7258

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Formal proof of a program: Find
Formal proof of a program: Find
✍ Jean-Christophe FilliΓ’tre πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 232 KB

In 1971, C.A.R. Hoare gave the proof of correctness and termination of a rather complex algorithm, in a paper entitled Proof of a program: Find. It is a handmade proof, where the program is given together with its formal specification and where each step is fully justified by mathematical reasoning.

Correctness proofs of CSP programs
Correctness proofs of CSP programs
✍ N. Soundararajan πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 948 KB
Typed ?-calculus at work: A correctness
Typed ?-calculus at work: A correctness proof of Jones's parallelisation transformation on concurrent objects
✍ Sangiorgi, Davide πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 118 KB

Cliff Jones has proposed transformations between concrete programs and general transformation rules that increase concurrency in a system of objects, and has raised the challenge of how to prove their validity. We present a proof of correctness of the hardest of Jones's concrete transformations. The