Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic
Open Access
- 30 September 1980
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 12 (1) , 61-81
- https://doi.org/10.1016/0304-3975(80)90005-5
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- On the total correctness of nondeterministic programsTheoretical Computer Science, 1981
- And/Or Programs: A New Approach to Structured ProgrammingACM Transactions on Programming Languages and Systems, 1980
- Is “sometime” sometimes better than “always”?Communications of the ACM, 1978
- A note concerning intermittent assertionsACM SIGACT News, 1977
- Subgoal inductionCommunications of the ACM, 1977
- Verifying properties of parallel programsCommunications of the ACM, 1976
- An axiomatic basis for proving total correctness of goto-programsBIT Numerical Mathematics, 1976
- On the completeness of the inductive assertion methodJournal of Computer and System Sciences, 1975
- Algorithmic properties of structuresTheory of Computing Systems, 1967
- Proof of algorithms by general snapshotsBIT Numerical Mathematics, 1966