Verifying linearizability and lock-freedom with temporal logic

  • The development and analysis of efficient concurrent algorithms is currently an active field of research. Lock-free implementations try to better utilize the capacity of modern multi-core computers, by increasing the potential to run in parallel. This leads to a high degree of possible interference which makes the verification of these algorithms challenging. Many techniques have been proposed to prove safety and liveness properties of these implementations. Our approach is fully mechanized and based upon rely-guarantee reasoning and the temporal logic framework of the interactive theorem prover KIV. By means of a slightly improved version of Michael and Scott’s lock-free queue algorithm we describe how the most complex parts of the proofs can be reduced to simple steps of symbolic execution.

Download full text files

Export metadata


Number of document requests

Additional Services

Share in Twitter Search Google Scholar
Author:Bogdan Tofan, Simon BäumlerGND, Gerhard SchellhornGND, Wolfgang ReifGND
Frontdoor URL
Series (Serial Number):Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg (2009-20)
Publisher:Universität Augsburg
Place of publication:Augsburg
Year of first Publication:2009
Publishing Institution:Universität Augsburg
Release Date:2009/12/21
Tag:verification; temporal logic; compositional reasoning; rely-guarantee; linearizability; lock-freedom
GND-Keyword:Verifikation; Temporale Logik; Rely-Guarantee-Methode
Institutes:Fakultät für Angewandte Informatik
Fakultät für Angewandte Informatik / Institut für Informatik
Fakultät für Angewandte Informatik / Institut für Software & Systems Engineering
Fakultät für Angewandte Informatik / Institut für Informatik / Lehrstuhl für Softwaretechnik
Dewey Decimal Classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Licence (German):Deutsches Urheberrecht