The following pages link to (Q4436966):
Displaying 7 items.
- Testing for refinement in \textsf{Circus} (Q766162) (← links)
- Formal and incremental construction of distributed algorithms: on the distributed reference counting algorithm (Q860848) (← links)
- A UTP semantics for \textsf{Circus} (Q1019016) (← links)
- Spot the difference: a detailed comparison between B and Event-B (Q2117587) (← links)
- Practical Theory Extension in Event-B (Q2842627) (← links)
- (Q4553283) (← links)
- Incremental Parametric Development of Greedy Algorithms (Q5178994) (← links)