Output details
11 - Computer Science and Informatics
Newcastle University
Return to search
Output 0 of 0 in the submission
Article title
Elucidating concurrent algorithms via layers of abstraction and reification
Type
D - Journal article
Title of journal
Formal Aspects of Computing
Article number
-
Volume number
23
Issue number
3
First page of article
289
ISSN of journal
1433-299X
Year of publication
2011
Number of additional authors
1
Additional information
<10> The importance here is the general result that rely/guarantee reasoning can tackle race-free programs. O'Hearn's oft-quoted and superficially attractive characterisation is that Separation Logic should be used to show race freedom whereas R/G handles "racy" programs. The example tackled is Simpson's extremely delicate "4-slot" algorithm. The point of the algorithm is to avoid races but the paper shows that R/G reasoning can show race freedom at an abstract level. Coupled with other ideas this is providing a new way of looking at what might be seen as competitive approaches to concurrency.
Interdisciplinary
-
Cross-referral requested
-
Research group
C - Dependability
Citation count
3
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-