A Concept-Driven Construction of the Mondex Protocol Using Three Refinements
ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z
How to prove algorithms linearisable
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Hi-index | 0.00 |
We identify a refinement algebra for reasoning about probabilistic program transformations in a total-correctness setting. The algebra is equipped with operators that determine whether a program is enabled or terminates respectively. As well as developing ...