General correctness: A unification of partial and total correctness
From MaRDI portal
Publication:2265798
DOI10.1007/BF00290146zbMATH Open0559.68021OpenAlexW1990589200MaRDI QIDQ2265798FDOQ2265798
Publication date: 1985
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00290146
Recommendations
- Unifying Recursion in Partial, Total and General Correctness
- Partial, total and general correctness
- Formalising general correctness
- Total correctness in nonstandard logics of programs
- General correctness algebra
- scientific article; zbMATH DE number 1531378
- An elementary and unified approach to program correctness
- Junctive compositions of specifications in total and general correctness
- Partial correctness: The term-wise approach
- Some general incompleteness results for partial correctness logics
semanticsnondeterminismweakest preconditionpredicate transformersGeneral correctnesspartial and total correctnessweakest and strongest postconditions
Cites Work
- Title not available (Why is that?)
- Nondeterministic Algorithms
- A Powerdomain Construction
- Title not available (Why is that?)
- A logic covering undefinedness in program proofs
- General correctness: A unification of partial and total correctness
- Predicative programming Part I
- Some Properties of Predicate Transformers
- A simple relation between relational and predicate transformer semantics for nondeterministic programs
- A characterization of weakest preconditions
- Title not available (Why is that?)
- Consistent and complementary formal theories of the semantics of programming languages
- Title not available (Why is that?)
- On the total correctness of nondeterministic programs
- Title not available (Why is that?)
Cited In (24)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multirelations with infinite computations
- Fixpoints for general correctness
- Partial correctness for probabilistic demonic programs
- Combining angels, demons and miracles in program specifications
- Predicate transformers as power operations
- Towards reasoning about Hoare relations
- Algebras for iteration and infinite computations
- General correctness algebra
- A calculus of refinements for program derivations
- Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
- General correctness: A unification of partial and total correctness
- Generalization in the presence of free variables: A mechanically-checked correctness proof for one algorithm
- Of wlp and CSP
- Infinite executions of lazy and strict computations
- Title not available (Why is that?)
- Partial correctness: The term-wise approach
- Title not available (Why is that?)
- Dual unbounded nondeterminacy, recursion, and fixpoints
- Predicate-transformer semantics of general recursion
- Unifying Recursion in Partial, Total and General Correctness
- Abstract commands: A uniform notation for specification and implementation
- Lifting General Correctness into Partial Correctness is ok
This page was built for publication: General correctness: A unification of partial and total correctness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2265798)
