You are in : Home » Results & submissions » Select UOA » 11 - Computer Science and Informatics » View submission: Imperial College London » Outputs » Detail

Output details

11 - Computer Science and Informatics

Imperial College London

Return to search Previous output Next output

Output 0 of 0 in the submission

Output title

Concurrent Abstract Predicates

Type

E - Conference contribution

DOI

10.1007/978-3-642-14107-2_24

Name of conference/published proceedings

24th European Conference on Object-Oriented Programming (ECOOP 2010)

Volume number

6183

Issue number

First page of article

504

ISSN of proceedings

0302-9743

Year of publication

2010

URL

Number of additional authors

Additional information

<11>There has been much work on modular reasoning about concurrent programs using separation logic. This paper demonstrates that abstraction is essential for strong modular reasoning about concurrent programs. E.g., we link abstract reasoning about concurrent sets with concrete reasoning about implementations using linked-lists and, in OOPSLA'11, hash tables and concurrent B-trees. We thus provide a `fiction of disjointness' for the set reasoning, independent of the underlying implementation. Previously, this was not possible. It led to: (1)an invited tutorial at ECOOP'12; (2)a keynote at CALCO'11; (3)REMS programme grant (EP/K008528/1 PI:Sewell); (4)Dagstuhl seminar on concurrency verification, 2015 Acceptance 22%/108

Interdisciplinary

Cross-referral requested

Research group

E - Programming Languages and Systems

Citation count

Proposed double-weighted

Double-weighted statement

Reserve for a double-weighted output

Non-English

English abstract