2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science 2013
DOI: 10.1109/lics.2013.18
|View full text |Cite
|
Sign up to set email alerts
|

Quantitative Reasoning for Proving Lock-Freedom

Abstract: Abstract-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 the verification of safety properties. Using a single formalism for verifying memory safety and lock-freedom allows a combined correctness proof that verifies both properties simultaneously.This article prese… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
30
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 24 publications
(30 citation statements)
references
References 38 publications
0
30
0
Order By: Relevance
“…Theorem 1 (Hoffmann et al [10]). Given a module M, if, for all m and n, every program c ∈ C m,n terminates, then M is lock free.…”
Section: Lock-freedommentioning
confidence: 99%
See 2 more Smart Citations
“…Theorem 1 (Hoffmann et al [10]). Given a module M, if, for all m and n, every program c ∈ C m,n terminates, then M is lock free.…”
Section: Lock-freedommentioning
confidence: 99%
“…Based on this observation, Gotsman et al [7] reduced lock-freedom to the termination of a simple class of programs, the bounded most-general clients (BMGCs) of a module. Hoffmann et al [10] generalised the result to apply to algorithms where the identity or number of threads is significant. An (m, n)-bounded general client consists of m threads which each invoke n module operations in sequence.…”
Section: Lock-freedommentioning
confidence: 99%
See 1 more Smart Citation
“…Inspired by Hoffmann et al's logic for lock-freedom [7], we introduce a counter n (i.e. the number of tokens assigned to the current thread) as a while-specific metric, which means the thread can only run the loop for no more than n rounds before it or its environment fulfils one or more source-level moves.…”
Section: Program Logicmentioning
confidence: 99%
“…Our work is based on our previous compositional simulation RGSim [11] (which unfortunately cannot preserve termination), and is inspired by Hoffmann et al's program logic for lock- freedom [7] (which does not support refinement verification and has limitations on local reasoning, as we will explain in Sec. 7), but makes the following new contributions:…”
Section: Introductionmentioning
confidence: 99%