Statement inversion and strongest postcondition

DOI10.1016/0167-6423(93)90015-HMaRDI QIDQ1261493zbMATH OpenOpenAlexFDO

Authors K. Appert

Publication date 31 January 1994

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6423(93)90015-h

zbMATH Keywords

weakest preconditiondemonic and angelic nondeterminisminverse commands

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Recommendations

• Running programs backwards: The logical inversion of imperative computation
• Combining angels, demons and miracles in program specifications
• scientific article; zbMATH DE number 3974258
• Semi-inversion of conditional constructor term rewriting systems
• scientific article; zbMATH DE number 512961

Cited in

(2)

• Predicate transformers as power operations
• The lattice of data refinement

This page was built for publication: Statement inversion and strongest postcondition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1261493)