Journal article

ABDULLA Parosh A., HAZIZA Frédéric, HOLÍK Lukáš, JONSSON Bengt and REZINE Ahmed. An integrated specification and verification technique for highly concurrent data structures for highly concurrent data structures. International Journal on Software Tools for Technology Transfer. 2017, vol. 5, no. 19, pp. 549-563. ISSN 1433-2779. Available from: https://link.springer.com/article/10.1007/s10009-016-0415-4
Publication language:english
Original title:An integrated specification and verification technique for highly concurrent data structures for highly concurrent data structures
Title (cs):Integrovaná verifikační a specifikační technika pro ověřování linearizability paralelních ukazatelových programů
Pages:549-563
Place:DE
Year:2017
URL:https://link.springer.com/article/10.1007/s10009-016-0415-4
Journal:International Journal on Software Tools for Technology Transfer, Vol. 5, No. 19, DE
ISSN:1433-2779
DOI:10.1007/s10009-016-0415-4
Keywords
verification, linearisability, pointers 
Annotation
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.
BibTeX:
@ARTICLE{
   author = {A. Parosh Abdulla and Fr{\'{e}}d{\'{e}}ric Haziza
	and Luk{\'{a}}{\v{s}} Hol{\'{i}}k and Bengt
	Jonsson and Ahmed Rezine},
   title = {An integrated specification and verification
	technique for highly concurrent data structures
	for highly concurrent data structures},
   pages = {549--563},
   journal = {International Journal on Software Tools for Technology
	Transfer},
   volume = {5},
   number = {19},
   year = {2017},
   ISSN = {1433-2779},
   doi = {10.1007/s10009-016-0415-4},
   language = {english},
   url = {http://www.fit.vutbr.cz/research/view_pub.php.en.iso-8859-2?id=11541}
}

Your IPv4 address: 54.81.69.220