Proc. of the European symposium on programming on ESOP 86
Predicate calculus and program semantics
Predicate calculus and program semantics
The existence of refinement mappings
Theoretical Computer Science
The Z notation: a reference manual
The Z notation: a reference manual
The lattice of data refinement
Acta Informatica
Programming from specifications (2nd ed.)
Programming from specifications (2nd ed.)
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
An axiomatic basis for computer programming
Communications of the ACM
A Discipline of Programming
More Powerful Z Data Refinement: Pushing the State of the Art in Industrial Refinement
ZUM '98 Proceedings of the 11th International Conference of Z Users on The Z Formal Specification Notation
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
Refinement of State-Based Concurrent Systems
VDM '90 Proceedings of the Third International Symposium of VDM Europe on VDM and Z - Formal Methods in Software Development
Data Refinement: Model-Oriented Proof Methods and their Comparison
Data Refinement: Model-Oriented Proof Methods and their Comparison
Verifying Michael and Scott's lock-free queue algorithm using trace reduction
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
A Practical Single Refinement Method for B
ABZ '08 Proceedings of the 1st international conference on Abstract State Machines, B and Z
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
Synthesis of scenario based test cases from b models
FATES'06/RV'06 Proceedings of the First combined international conference on Formal Approaches to Software Testing and Runtime Verification
A fixpoint semantics of event systems with and without fairness assumptions
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
| Hi-index | 0.00 |
The B Method exploits a direct first-order wp predicate-transformer formulation of downward simulation to generate its proof obligations for a refinement, so B's notion of refinement is restricted to that of forward refinement. Therefore some refinements we would intuitively recognise as valid cannot be proved so in B. While relational formulations of upward simulation abound in the refinement literature, the only predicate-transformer formulations proposed hitherto have been higher-order ones quantified over all postconditions, which cannot be conveniently exploited by the B Method. Here, we propose a new first-order predicate-transformer formulation of upward simulation suitable to be adopted by B for backward refinement.