Paper Info
Title
An integrated specification and verification technique for highly concurrent data structures for highly concurrent data structures.
Abstract
We present a technique for automatically verifying safety properties of concurrent programs, in particular programs that rely on subtle dependencies of local states of different threads, such as lock-free implementations of stacks and queues in an environment without garbage collection. Our technique addresses the joint challenges of infinite-state specifications, an unbounded number of threads, and an unbounded heap managed by explicit memory allocation. Our technique builds on the automata-theoretic approach to model checking, in which a specification is given by an automaton that observes the execution of a program and accepts executions that violate the intended specification. We extend this approach by allowing specifications to be given by a class of infinite-state automata. We show how such automata can be used to specify queues, stacks, and other data structures, by extending a data-independence argument. For verification, we develop a shape analysis, which tracks correlations between pairs of threads, and a novel abstraction to make the analysis practical. We have implemented our method and used it to verify programs, some of which have not been verified by any other automatic method before.
Year
DOI
Venue
2017
10.1007/s10009-016-0415-4
STTT
Keywords
Field
DocType
Verification, Pointer programs, Explicit memory allocation, Queue, Stack, Unbounded, Concurrency, Specification, Linearizability
Linearizability,Data structure,Model checking,Programming language,Computer science,Concurrency,Thread (computing),Real-time computing,Heap (data structure),Garbage collection,Concurrent data structure
Journal
Volume
Issue
ISSN
19
5
1433-2787
Citations 
PageRank 
References 
3
0.38
28
Authors
5
Name
Order
Citations
PageRank
Parosh Aziz Abdulla12010122.22
Frédéric Haziza21096.26
Lukás Holík310715.76
bengt jonsson43637263.46
Ahmed Rezine537823.10