Total correctness in nonstandard logics of programs
- 31 December 1987
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 50 (3) , 285-321
- https://doi.org/10.1016/0304-3975(87)90118-6
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A simple dynamic logicTheoretical Computer Science, 1986
- Non-standard algorithmic and dynamic logicJournal of Symbolic Computation, 1986
- A completeness theorem for dynamic logic.Notre Dame Journal of Formal Logic, 1985
- Recursive Programs as Definitions in First-Order LogicSIAM Journal on Computing, 1984
- STRUCTURED NONSTANDARD DYNAMIC LOGICMathematical Logic Quarterly, 1984
- 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
- Is “sometime” sometimes better than “always”?Communications of the ACM, 1978
- On the termination of program schemasInformation and Control, 1975