Quantitative Reasoning for Proving Lock-Freedom

This article describes a novel quantitative proof technique for the modular and local verification of lock-freedom. In contrast to proofs based on temporal rely-guarantee requirements, this new quantitative reasoning method can be directly integrated in modern program logics that are designed for th...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science S. 124 - 133
Hauptverfasser:	Hoffmann, Jan, Marmar, Michael, Zhong Shao
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.06.2013
Schlagworte:	Cognition Concurrency Data structures Educational institutions Interference Liveness Lock-Freedom Non-Blocking Data Structures Quantitative Analysis Safety Separation Logic Synchronization Upper bound
ISBN:	1479904139, 9781479904136
ISSN:	1043-6871
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!