| dc.contributor.author | TZEVELEKOS, NP | |
| dc.contributor.author | Murawski, AS | |
| dc.date.accessioned | 2019-01-30T15:41:03Z | |
| dc.date.available | 2019-01-11 | |
| dc.date.available | 2019-01-30T15:41:03Z | |
| dc.date.issued | 2019 | |
| dc.identifier.citation | Murawski, A. and Tzevelekos, N. (2019). Higher-Order Linearisability. [online] arXiv.org. Available at: https://arxiv.org/abs/1610.07965 [Accessed 30 Jan. 2019]. | en_US |
| dc.identifier.issn | 2352-2208 | |
| dc.identifier.uri | https://qmro.qmul.ac.uk/xmlui/handle/123456789/55025 | |
| dc.description.abstract | Linearisability is a central notion for verifying concurrent libraries: a library is proven
correct if its operational history can be rearranged into a sequential one that satisfies a
given specification. Until now, linearisability has been examined for libraries in which
method arguments and method results were of ground type. In this paper we extend
linearisability to the general higher-order setting, where methods of arbitrary type can
be passed as arguments and returned as values, and establish its soundness. | en_US |
| dc.publisher | Elsevier | en_US |
| dc.relation.ispartof | Journal of Logical and Algebraic Methods in Programming | |
| dc.rights | This is a pre-copyedited, author-produced version of an article accepted for publication in Journal of Logical and Algebraic Methods in Programming following peer review. | |
| dc.title | Higher-Order Linearisability | en_US |
| dc.type | Article | en_US |
| dc.rights.holder | © 2019 Elsevier | |
| pubs.notes | Not known | en_US |
| pubs.publication-status | Accepted | en_US |
| dcterms.dateAccepted | 2019-01-11 | |
| rioxxterms.funder | Default funder | en_US |
| rioxxterms.identifier.project | Default project | en_US |
| qmul.funder | System-Level Game Semantics: A unifying framework for composing systems::Engineering and Physical Sciences Research Council | en_US |
