A Practical Single Refinement Method for B

Steve Dunne, Stacey Conroy
Digital Printed Abstract View Cite
Type
Conference paper
Publication
1st International Conference on ASM, B, and Z (ABZ'08)

Abstract

We propose a single refinement method for B, inspired directly by Gardiner and Morgan’s longstanding single complete rule for data refinement, and rendered practical by application of the current first author’s recent first-order characterisation of refinement between monotonic computations.

Document

If you cannot see the document below, the PDF document is most likely not freely accessible. In this case, please try to access the document via this link.

Reference

% BibTex
@inproceedings{DunneC08,
  author       = {Steve Dunne and
                  Stacey Conroy},
  editor       = {Egon B{\"{o}}rger and
                  Michael J. Butler and
                  Jonathan P. Bowen and
                  Paul Boca},
  title        = {A Practical Single Refinement Method for {B}},
  booktitle    = {Abstract State Machines, {B} and Z, First International Conference,
                  {ABZ} 2008, London, UK, September 16-18, 2008. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5238},
  pages        = {195--208},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-87603-8\_16},
  doi          = {10.1007/978-3-540-87603-8\_16},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/asm/DunneC08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
ABZ'08

Related