Journal article
Higher-order linearisability
- 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.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Version of record, pdf, 995.6KB, Terms of use)
-
- Publisher copy:
- 10.1016/j.jlamp.2019.01.002
Authors
- Publisher:
- Elsevier
- Journal:
- Journal of Logical and Algebraic Methods in Programming More from this journal
- Volume:
- 104
- Pages:
- 86-116
- Publication date:
- 2019-01-21
- Acceptance date:
- 2019-01-11
- DOI:
- ISSN:
-
2352-2208
- Keywords:
- Pubs id:
-
pubs:981225
- UUID:
-
uuid:755f774e-3083-42a2-9de9-544d5eda87e0
- Local pid:
-
pubs:981225
- Source identifiers:
-
981225
- Deposit date:
-
2019-03-10
- ARK identifier:
Terms of use
- Copyright holder:
- Murawski
- Copyright date:
- 2019
- Notes:
- © 2019 The Authors. Published by Elsevier Inc. This is an open access article under the CC BY license
- Licence:
- CC Attribution (CC BY)
If you are the owner of this record, you can report an update to it here: Report update to this record