For the current REF see the REF 2021 website REF 2021 logo

Output details

11 - Computer Science and Informatics

University of York

Return to search Previous output Next output
Output 7 of 139 in the submission
Output title

A simple abstraction for complex concurrent indexes

Type
E - Conference contribution
Name of conference/published proceedings
OOPSLA '11 : Proceedings of the 2011 ACM international conference on Object oriented programming systems language and applications
Volume number
-
Issue number
-
First page of article
845
ISSN of proceedings
-
Year of publication
2011
Number of additional authors
4
Additional information

<10>This paper demonstrated the usefulness of modular reasoning based on concurrent abstract predicates, by applying CAP to several realistic index algorithms. In comparison to Krishnaswami, this paper radically simplifies and generalises the interface presented to clients. Furthermore, this paper verifies a real-world index implementation, the widely-used B-Link tree. As a demonstration of the significance of this approach, it uncovered an apparently-unknown bug in this algorithm. This paper also introduced the idea of using separation-logic style reasoning to express epistemic uncertainty, an idea later developed in Fictional Separation Logic by Jensen et al and Subjective Auxiliary State by Ley-Wild et al.

Interdisciplinary
-
Cross-referral requested
-
Research group
A - High Integrity Systems Engineering
Citation count
2
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-