𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Formal correctness proofs of a nondeterministic program

✍ Scribed by Eliezer Upfal


Book ID
113162466
Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
665 KB
Volume
14
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


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
✍ N. Soundararajan πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 948 KB