A practical single refinement method for B

Hdl Handle:
http://hdl.handle.net/10149/93947
Title:
A practical single refinement method for B
Book Title:
Abstract state machines, B and Z
Authors:
Dunne, S. E. (Steve); Conroy, S. (Stacey)
Editors:
Börger, E. (Egon); Butler, M. (Michael); Bowen, J. P. (Jonathan); Boca, P. (Paul)
Affiliation:
University of Teesside. School of Computing.
Citation:
Dunne, S. E. and Conroy, S. (2009) 'A practical single refinement method for B', First international conference, ABZ, London, UK, September 16-18, in Börger, E. et al. (eds) Abstract state machines, B and Z, Lecture notes in computer science. Heidelberg: Springer Berlin, pp.195-208.
Publisher:
Springer Berlin
Conference:
First international conference, ABZ 2008, London, UK, September 16-18, 2008.
Issue Date:
Sep-2008
URI:
http://hdl.handle.net/10149/93947
DOI:
10.1007/978-3-540-87603-8_16
Abstract:
The authors 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.
Type:
Meetings and Proceedings; Book Chapter
Language:
en
Keywords:
engineering uncontrolled terms; characterisation; data refinements; refinement methods; monotonic computations; Gardiner and Morgan
Series/Report no.:
Lecture notes in computer science; 5238
ISSN:
0302-9743; 1611-3349
ISBN:
9783540876021
Rights:
Author can archive post-print (ie final draft post-refereeing). For full details see http://www.sherpa.ac.uk/romeo/ [Accessed 09/03/2010]
Citation Count:
0 [Scopus 09/03/2010]

Full metadata record

DC FieldValue Language
dc.contributor.authorDunne, S. E. (Steve)en
dc.contributor.authorConroy, S. (Stacey)en
dc.contributor.editorBörger, E. (Egon)en
dc.contributor.editorButler, M. (Michael)en
dc.contributor.editorBowen, J. P. (Jonathan)en
dc.contributor.editorBoca, P. (Paul)en
dc.date.accessioned2010-03-09T14:06:47Z-
dc.date.available2010-03-09T14:06:47Z-
dc.date.issued2008-09-
dc.identifier.isbn9783540876021-
dc.identifier.issn0302-9743-
dc.identifier.issn1611-3349-
dc.identifier.doi10.1007/978-3-540-87603-8_16-
dc.identifier.urihttp://hdl.handle.net/10149/93947-
dc.description.abstractThe authors 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.en
dc.language.isoenen
dc.publisherSpringer Berlinen
dc.relation.ispartofseriesLecture notes in computer science-
dc.relation.ispartofseries5238-
dc.rightsAuthor can archive post-print (ie final draft post-refereeing). For full details see http://www.sherpa.ac.uk/romeo/ [Accessed 09/03/2010]en
dc.subjectengineering uncontrolled termsen
dc.subjectcharacterisationen
dc.subjectdata refinementsen
dc.subjectrefinement methodsen
dc.subjectmonotonic computationsen
dc.subjectGardiner and Morganen
dc.titleA practical single refinement method for Ben
dc.typeMeetings and Proceedingsen
dc.typeBook Chapteren
dc.contributor.departmentUniversity of Teesside. School of Computing.en
dc.title.bookAbstract state machines, B and Zen
dc.identifier.conferenceFirst international conference, ABZ 2008, London, UK, September 16-18, 2008.en
ref.citationcount0 [Scopus 09/03/2010]en
or.citation.harvardDunne, S. E. and Conroy, S. (2009) 'A practical single refinement method for B', First international conference, ABZ, London, UK, September 16-18, in Börger, E. et al. (eds) Abstract state machines, B and Z, Lecture notes in computer science. Heidelberg: Springer Berlin, pp.195-208.-
prism.startingPage195-
prism.endingPage208-
All Items in TeesRep are protected by copyright, with all rights reserved, unless otherwise indicated.