An integrated specification and verification technique for highly concurrent data structures for highly concurrent data structures
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F17%3APU126456" target="_blank" >RIV/00216305:26230/17:PU126456 - isvavai.cz</a>
Result on the web
<a href="https://link.springer.com/article/10.1007/s10009-016-0415-4" target="_blank" >https://link.springer.com/article/10.1007/s10009-016-0415-4</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10009-016-0415-4" target="_blank" >10.1007/s10009-016-0415-4</a>
Alternative languages
Result language
angličtina
Original language name
An integrated specification and verification technique for highly concurrent data structures for highly concurrent data structures
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
International Journal on Software Tools for Technology Transfer
ISSN
1433-2779
e-ISSN
1433-2787
Volume of the periodical
5
Issue of the periodical within the volume
19
Country of publishing house
DE - GERMANY
Number of pages
15
Pages from-to
549-563
UT code for WoS article
000409295800004
EID of the result in the Scopus database
2-s2.0-84961203222