General correctness: A unification of partial and total correctness
- 1 April 1985
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 22 (1) , 67-83
- https://doi.org/10.1007/bf00290146
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A logic covering undefinedness in program proofsActa Informatica, 1984
- Predicative programming Part ICommunications of the ACM, 1984
- A simple relation between relational and predicate transformer semantics for nondeterministic programsInformation Processing Letters, 1980
- Semantics of unbounded nondeterminismPublished by Springer Nature ,1980
- Some Properties of Predicate TransformersJournal of the ACM, 1978
- Power domainsJournal of Computer and System Sciences, 1978
- A characterization of weakest preconditionsJournal of Computer and System Sciences, 1977
- A Powerdomain ConstructionSIAM Journal on Computing, 1976
- DIJKSTRA's predicate transformer, non-determinism, recursion, and terminationPublished by Springer Nature ,1976
- Nondeterministic AlgorithmsJournal of the ACM, 1967