Weak second order characterizations of various program verification systems
- 26 August 1989
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 66 (3) , 299-321
- https://doi.org/10.1016/0304-3975(89)90156-4
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Nonstandard Dynamic LogicPublished by Springer Nature ,2005
- An elementary proof for some semantic characterizations of nondeterministic Floyd-Hoare logic.Notre Dame Journal of Formal Logic, 1989
- The contributions of Alfred Tarski to algebraic logicThe Journal of Symbolic Logic, 1986
- Non-standard algorithmic and dynamic logicJournal of Symbolic Computation, 1986
- A completeness theorem for dynamic logic.Notre Dame Journal of Formal Logic, 1985
- Towards a nonstandard analysis of programsPublished by Springer Nature ,1983
- An axiomatization of the intermittent assertion method using temporal logicPublished by Springer Nature ,1983
- Programs and program verifications in a general settingTheoretical Computer Science, 1981
- Ten Years of Hoare's Logic: A Survey—Part IACM Transactions on Programming Languages and Systems, 1981
- On folk theoremsCommunications of the ACM, 1980