Introducing Backward Refinement into B

  • Steve Dunne
Conference paper

DOI: 10.1007/3-540-44880-2_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2651)
Cite this paper as:
Dunne S. (2003) Introducing Backward Refinement into B. In: Bert D., Bowen J.P., King S., Waldén M. (eds) ZB 2003: Formal Specification and Development in Z and B. ZB 2003. Lecture Notes in Computer Science, vol 2651. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Steve Dunne
    • 1
  1. 1.School of Computing and MathematicsUniversity of TeessideMiddlesbroughUK

Personalised recommendations