Communicating sequential processes
Communicating sequential processes
Predicate calculus and program semantics
Predicate calculus and program semantics
Systematic software development using VDM (2nd ed.)
Systematic software development using VDM (2nd ed.)
Data refinement of predicate transformers
Theoretical Computer Science
Combining angels, demons and miracles in program specifications
Theoretical Computer Science
Using Z: specification, refinement, and proof
Using Z: specification, refinement, and proof
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Refinement Calculus: A Systematic Introduction
Refinement Calculus: A Systematic Introduction
A Theory of Generalised Substitutions
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
Angelic nondeterminism in the unifying theories of programming
Formal Aspects of Computing
Compound monads in specification languages
PLPV '07 Proceedings of the 2007 workshop on Programming languages meets program verification
A Practical Single Refinement Method for B
ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z
Preference and non-deterministic choice
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
Monadic maps and folds for multirelations in an allegory
UTP'08 Proceedings of the 2nd international conference on Unifying theories of programming
| Hi-index | 0.00 |
We extend B's GSL by introducing new operators for angelic choice, thus widening its application from its original domain of conjunctive computations to that of monotonic ones in general. We explore the impact of this on our theory of substitutions [6], discovering two dual new normal forms for our new substitutions which we exploit to formulate two new first-order tests of refinement between them.