Nonstandard runs of Floyd-provable programs
- 1 January 1983
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 186-204
- https://doi.org/10.1007/3-540-11981-7_13
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Axioms of algorithmic logic univocally determine semantics of programsPublished by Springer Nature ,2005
- A complete logic for reasoning about programs via nonstandard model theory IITheoretical Computer Science, 1982
- Programs and program verifications in a general settingTheoretical Computer Science, 1981
- Making dynamic logic first-orderPublished by Springer Nature ,1981
- First order dynamic logic with decidable proofs and workable model theoryLecture Notes in Computer Science, 1981
- Cylindric Set AlgebrasLecture Notes in Mathematics, 1981
- Soundness and Completeness of an Axiom System for Program VerificationSIAM Journal on Computing, 1978