Wed 10 Jan 2018 17:05 - 17:30 at Bunker Hill - Memory and Concurrency Chair(s): Azadeh Farzan

Various progress properties have been proposed for concurrent objects, such as wait-freedom, lock-freedom, starvation-freedom and deadlock-freedom. However, none of them apply for concurrent objects with partial methods, i.e. methods that are supposed not to return under certain circumstances. A typical example is the lock_acquire method.

In this paper we propose two new progress properties, partial starvation-freedom (PSF) and partial deadlockfreedom (PDF), for concurrent objects with partial methods. We also design four patterns to write abstract specifications for PSF or PDF objects under strongly or weakly fair scheduling, so that these objects contextually refine the abstract specifications. Our Abstraction Theorem shows the equivalence between PSF (or PDF) and the progress-aware contextual refinement. Finally, we generalize the program logic LiLi to have a new logic to verify the PSF or PDF property and linearizability of concurrent objects.

Wed 10 Jan
Times are displayed in time zone: (GMT-07:00) Tijuana, Baja California change

15:50 - 17:30: Research Papers - Memory and Concurrency at Bunker Hill
Chair(s): Azadeh FarzanUniversity of Toronto
POPL-2018-papers15:50 - 16:15
Michalis KokologiannakisNational Technical University of Athens, Greece, Ori LahavTel Aviv University, Israel, Konstantinos (Kostis) Sagonas, Viktor VafeiadisMPI-SWS, Germany
POPL-2018-papers16:15 - 16:40
Brijesh DongolBrunel University London, Radha JagadeesanDePaul University, James RielyDePaul University
Link to publication DOI Pre-print Media Attached
POPL-2018-papers16:40 - 17:05
Christopher PulteUniversity of Cambridge, Shaked FlurUniversity of Cambridge, Will DeaconARM Ltd., Jon FrenchUniversity of Cambridge, Susmit SarkarUniversity of St. Andrews, Peter SewellUniversity of Cambridge
POPL-2018-papers17:05 - 17:30
Hongjin LiangUniversity of Science and Technology of China, Xinyu FengUniversity of Science and Technology of China