Pages that link to "Item:Q2265798"
From MaRDI portal
The following pages link to General correctness: A unification of partial and total correctness (Q2265798):
Displaying 24 items.
- Multirelations with infinite computations (Q406449) (← links)
- Fixpoints for general correctness (Q549677) (← links)
- Unifying wp and wlp (Q671411) (← links)
- Algebras for iteration and infinite computations (Q715050) (← links)
- Generalization in the presence of free variables: A mechanically-checked correctness proof for one algorithm (Q757074) (← links)
- Partial correctness: The term-wise approach (Q793507) (← links)
- Dual unbounded nondeterminacy, recursion, and fixpoints (Q995749) (← links)
- Predicate-transformer semantics of general recursion (Q1101439) (← links)
- A calculus of refinements for program derivations (Q1111362) (← links)
- Combining angels, demons and miracles in program specifications (Q1199826) (← links)
- Constructive design of a hierarchy of semantics of a transition system by abstract interpretation (Q1605224) (← links)
- Specifications, programs, and total correctness (Q1806131) (← links)
- Predicate transformers as power operations (Q1898816) (← links)
- Towards reasoning about Hoare relations (Q1924753) (← links)
- General correctness: A unification of partial and total correctness (Q2265798) (← links)
- Infinite executions of lazy and strict computations (Q2347906) (← links)
- Abstract commands: A uniform notation for specification and implementation (Q2703746) (← links)
- Junctive compositions of specifications in total and general correctness (Q2844814) (← links)
- Formalising general correctness (Q2845516) (← links)
- Unifying Correctness Statements (Q2908567) (← links)
- Of wlp and CSP (Q2994489) (← links)
- Unifying Recursion in Partial, Total and General Correctness (Q3055748) (← links)
- (Q3696492) (← links)
- An Inductive Theorem on the Correctness of General Recursive Programs (Q5436982) (← links)