Back to Search
Start Over
Higher-order linearisability
- Source :
- Journal of Logical and Algebraic Methods in Programming. 104:86-116
- Publication Year :
- 2019
- Publisher :
- Elsevier BV, 2019.
-
Abstract
- Linearisability is a central notion for verifying concurrent libraries: a given library is proven safe if its operational history can be rearranged into a new sequential one which, in addition, satisfies a given specification. Linearisability has been examined for libraries in which method arguments and method results are of ground type, including libraries parameterised with such methods. In this paper we extend linearisability to the general higher-order setting: methods can be passed as arguments and returned as values. A library may also depend on abstract methods of any order. We use this generalised notion to show correctness of several higher-order example libraries.
- Subjects :
- FOS: Computer and information sciences
Soundness
D.1.3
D.3.1
Computer Science - Programming Languages
000 Computer science, knowledge, general works
Logic
Computer science
Type (model theory)
QA76
Theoretical Computer Science
Computational Theory and Mathematics
Order (business)
Computer Science
Calculus
Software
Programming Languages (cs.PL)
Subjects
Details
- ISBN :
- 978-3-95977-048-4
- ISSN :
- 23522208
- ISBNs :
- 9783959770484
- Volume :
- 104
- Database :
- OpenAIRE
- Journal :
- Journal of Logical and Algebraic Methods in Programming
- Accession number :
- edsair.doi.dedup.....40c190928c55546d2eae266dede2a8d3
- Full Text :
- https://doi.org/10.1016/j.jlamp.2019.01.002