The following pages link to Data refinement by calculation (Q913482):
Displayed 20 items.
- A tactic language for refinement of state-rich concurrent specifications (Q541214) (← links)
- Predicate transformers and higher-order programs (Q672318) (← links)
- Algebraic proofs of consistency and completeness (Q672320) (← links)
- A single complete rule for data refinement (Q684396) (← links)
- Angelic nondeterminism in the unifying theories of programming (Q851128) (← links)
- Some proofs of data refinement (Q911246) (← links)
- Command algebras, recursion and program transformation (Q911748) (← links)
- Alternating states for dual nondeterminism in imperative programming (Q974118) (← links)
- Trace-based derivation of a scalable lock-free stack algorithm (Q1019022) (← links)
- Auxiliary variables in data refinement (Q1114384) (← links)
- Nondeterminacy and recursion via stacks and games (Q1318704) (← links)
- Program refinement in fair transition systems (Q1323314) (← links)
- The lattice of data refinement (Q1323380) (← links)
- Soundness of data refinement for a higher-order imperative language (Q1605184) (← links)
- Model-based specification (Q1607085) (← links)
- Angelic processes for CSP via the UTP (Q1757156) (← links)
- Safety and progress of recursive procedures (Q1903075) (← links)
- Strongly Typed Rewriting For Coupled Software Transformation (Q2864515) (← links)
- Constraint-aware Schema Transformation (Q5166635) (← links)
- Calculating modules in contextual logic program refinement (Q5437648) (← links)