Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/13188
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDongol, B-
dc.contributor.authorGroves, L-
dc.contributor.editorDerrick, J-
dc.contributor.editorBoiten, E-
dc.contributor.editorReeves, S-
dc.date.accessioned2016-09-21T10:02:20Z-
dc.date.available2016-06-04-
dc.date.available2016-09-21T10:02:20Z-
dc.date.issued2016-
dc.identifier.citationElectronic Proceedings in Theoretical Computer Science, 209: pp. 107 - 111, (2016)en_US
dc.identifier.issn2075-2180-
dc.identifier.urihttp://bura.brunel.ac.uk/handle/2438/13188-
dc.description.abstractCorrectness conditions for concurrent objects describe how atomicity of an abstract sequential object may be decomposed. Many different concurrent objects and proof methods for them have been developed. However, arguments about correctness are conducted with respect to an object in isolation. This is in contrast to real-world practice, where concurrent objects are often implemented as part of a programming language library (e.g., java.util.concurrent) and are instantiated within a client program. A natural question to ask, then is: How does a correctness condition for a concurrent object ensure correctness of a client program that uses the concurrent object? This paper presents the main issues that surround this question and provides some answers by linking different correctness conditions with a form of trace refinement.en_US
dc.format.extent107 - 111-
dc.language.isoenen_US
dc.titleTowards linking correctness conditions for concurrent objects and contextual trace refinementen_US
dc.typeArticleen_US
dc.identifier.doihttp://dx.doi.org/10.4204/EPTCS.209.8-
dc.relation.isPartOfElectronic Proceedings in Theoretical Computer Science-
pubs.publication-statusPublished-
pubs.volume209-
Appears in Collections:Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdf153.9 kBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.