On the strength of “sometimes” and “always” in program verification
- 30 June 1983
- journal article
- Published by Elsevier in Information and Control
- Vol. 57 (2-3) , 165-179
- https://doi.org/10.1016/s0019-9958(83)80042-4
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A complete logic for reasoning about programs via nonstandard model theory IITheoretical Computer Science, 1982
- A complete logic for reasoning about programs via nonstandard model theory ITheoretical Computer Science, 1982
- Programs and program verifications in a general settingTheoretical Computer Science, 1981
- Soundness and Completeness of an Axiom System for Program VerificationSIAM Journal on Computing, 1978
- Is “sometime” sometimes better than “always”?Communications of the ACM, 1978