The following pages link to On correct refinement of programs (Q1157144):
Displaying 13 items.
- Generalised rely-guarantee concurrency: an algebraic foundation (Q333330) (← links)
- Predicate transformers and higher-order programs (Q672318) (← links)
- Formal and incremental construction of distributed algorithms: on the distributed reference counting algorithm (Q860848) (← links)
- A calculus of refinements for program derivations (Q1111362) (← links)
- Combining angels, demons and miracles in program specifications (Q1199826) (← links)
- The weakest precondition calculus: Recursion and duality (Q1346768) (← links)
- Parallel composition and decomposition of specifications (Q1602555) (← links)
- Predicate transformers as power operations (Q1898816) (← links)
- Integrating formal specifications into applications: the ProB Java API (Q2147695) (← links)
- Temporal reasoning through automatic translation of tock-CSP into timed automata (Q2154047) (← links)
- Relational demonic fuzzy refinement (Q2336161) (← links)
- A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency (Q2414249) (← links)
- Refinement and state machine abstraction (Q5958757) (← links)
