Gardner, Philippa

English

Dagstuhl Research Online Publication Server

Concurrent Separation Logics: Logical Abstraction,Logical Atomicity and Environment LivenessConditionsPhilippa Gardner #Imperial College London, UKAbstractScalable verification for concurrent programs with shared memory is a long-standing, difficult problem.In 2004, O’Hearn and Brookes introduced concurrent separation logic to provide compositionalreasoning about coarse-grained concurrent programs with synchronisation primitives (Gödel prize,2016).In 2010, I introduced logical abstraction (the fiction of separation) to CSL, developing theCAP logic for reasoning about fine-grained concurrent programs in general and fine-grained lockalgorithms in particular. In one logic, it was possible to provide two-sided specifications of concurrentoperations, with formally verified implementations and clients.In 2014, I introduced logical atomicity (the fiction of atomicity) to concurrent separation logics,developing the TaDA logic to capture when individual operations behave atomically. Unlike CAP,where synchronisation primitives leak into the specifications, with TaDA the specifications are “justright” in that they provide more general atomic functions specifications to capture, for example, thefull behaviour of lock operations.In 2021, I introduced environment liveness conditions to concurrent separation logics, developingthe TaDA Live logic for reasoning compositionally about the termination of blocking fine-grainedconcurrent programs. The crucial challenge is how to deal with abstract atomic blocking: that is,abstract atomic operations that have blocking behaviour arising from busy-waiting patterns as foundin, for example, fine-grained spin locks. The fundamental innovation is with the design of abstractspecifications that capture this blocking behaviour as liveness assumptions on the environment.In this talk, I will explain this on-going journey in the wonderful world of concurrent separationlogics. I will also explain why I have a bright green office chair in the corner of my office, patternedin gold lamé.Many thanks to my fabulous coauthors on concurrent separation logics: Thomas Dinsdale-Young,Emanuele D’Osualdo, Mike Dodds, Azadeh Farzan, Matthew Parkinson, Pedro da Rocha Pinto,Julian Sutherland, Viktor Vafeiadis and more.Suggested Reading:Peter O’Hearn: Resources, Concurrency and Local Reasoning, Journal of Theoretical ComputerScience, Festschrift for John C Reynolds 70th birthday, 2007.Thomas Dinsdale-Young, Pedro da Rocha Pinto and Philippa Gardner: A Perspective onSpecifying and Verifying Concurrent Modules, Journal of Logical and Algebraic Methods inProgramming, 2018.Emanuele D’Osualdo, Azadeh Farzan, Philippa Gardner and Julian Sutherland: TaDA Live:Compositional Reasoning for Termination of Fine-grained Concurrent Programs, ACM Transac-tions on Programming Languages and Systems (TOPLAS), 2021.2012 ACM Subject Classification Theory of computation → ConcurrencyKeywords and phrases Concurrent separation logicDigital Object Identifier 10.4230/LIPIcs.CONCUR.2022.2Category Invited Talk© Philippa Gardner;licensed under Creative Commons License CC-BY 4.033rd International Conference on Concurrency Theory (CONCUR 2022).Editors: Bartek Klin, Sławomir Lasota, and Anca Muscholl; Article No. 2; pp. 2:1–2:1Leibniz International Proceedings in InformaticsSchloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing, Germany

Concurrent Separation Logics: Logical Abstraction, Logical Atomicity and Environment Liveness Conditions (Invited Talk)

https://drops.dagstuhl.de/opus/volltexte/2022/17065/pdf/LIPIcs-CONCUR-2022-2.pdf

Concurrent Separation Logics: Logical Abstraction, Logical Atomicity and Environment Liveness Conditions (Invited Talk)

Abstract

Similar works

Full text

Available Versions

Dagstuhl Research Online Publication Server