Pages that link to "Item:Q1346768"
From MaRDI portal
The following pages link to The weakest precondition calculus: Recursion and duality (Q1346768):
Displaying 18 items.
- Generic weakest precondition semantics from monads enriched with order (Q890376) (← links)
- Command algebras, recursion and program transformation (Q911748) (← links)
- Alternating states for dual nondeterminism in imperative programming (Q974118) (← links)
- Predicate-transformer semantics of general recursion (Q1101439) (← links)
- Weakest precondition semantics for time and concurrency (Q1195491) (← links)
- Combining angels, demons and miracles in program specifications (Q1199826) (← links)
- The weakest precondition calculus: Recursion and duality (Q1346768) (← links)
- Coordinating action systems (Q1592481) (← links)
- Instrumenting a weakest precondition calculus for counterexample generation (Q1648649) (← links)
- A fixpoint theory for non-monotonic parallelism (Q1884887) (← links)
- Safety and progress of recursive procedures (Q1903075) (← links)
- Symbolic execution formally explained (Q1982639) (← links)
- On the inherent weakness of conditional primitives (Q2375295) (← links)
- Weakest preconditioned goto axiom (Q2680222) (← links)
- Weakest relative precondition semantics. Balancing approved theory and realistic translation verification (Q2723562) (← links)
- Some Variants of the Weakest Precondition in Nondeterminism (Q3723689) (← links)
- (Q3971273) (← links)
- (Q4903948) (← links)