Show simple item record

dc.contributor.authorDunne, S. E.en_GB
dc.contributor.authorConroy, S.en_GB
dc.date.accessioned2013-07-01T13:55:34Z
dc.date.available2013-07-01T13:55:34Z
dc.date.issued2008-08
dc.identifier.citationDunne, 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.en_GB
dc.identifier.isbn9783540876021
dc.identifier.issn0302-9743
dc.identifier.doi10.1007/978-3-540-87603-8_16
dc.identifier.urihttp://hdl.handle.net/2384/295023
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 computationsen_GB
dc.publisherSpringer Berlinen_GB
dc.subjectengineering uncontrolled termsen_GB
dc.subjectcharacterisationen_GB
dc.subjectdata refinementsen_GB
dc.subjectrefinement methodsen_GB
dc.titleA practical single refinement method for Ben_GB
dc.typeBook Chapteren
dc.typeMeetings and Proceedingsen
dc.contributor.departmentUniversity of Teesside. School of Computing.en_GB
refterms.dateFOA2018-02-14T10:13:06Z


Files in this item

Thumbnail
Name:
A practical single refinement ...
Size:
399.3Kb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record