Conference paper

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. In: 19th International Conference, TACAS 2013. Berlin Heidelberg: Springer Verlag, 2013, pp. 324-338. ISBN 978-3-642-36742-7. ISSN 0302-9743.
Publication language:english
Original title:An Integrated Specification and Verification Technique for Highly Concurrent Data Structures
Title (cs):Integrovaná specifikační a verifikační technika pro vysoce paralelní datové struktury
Pages:324-338
Proceedings:19th International Conference, TACAS 2013
Conference:European Joint Conferences on Theory and Practice of Software -- ETAPS'13 (TACAS'13)
Series:Lecture Notes in Computer Science 7795
Place:Berlin Heidelberg, DE
Year:2013
ISBN:978-3-642-36742-7
Journal:Lecture Notes in Computer Science, Vol. 2013, No. 0000, DE
ISSN:0302-9743
Publisher:Springer Verlag
URL:http://link.springer.com/chapter/10.1007%2F978-3-642-36742-7_23 [HTML]
Keywords
verification, specification, concurrency, parallelism, lock-free data structures, automata, data independence, thread modular, precision

Annotation
We present a technique for automatically verifying safety properties of concurrent programs, in particular programs which 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:
@INPROCEEDINGS{
   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},
   pages = {324--338},
   booktitle = {19th International Conference, TACAS 2013},
   series = {Lecture Notes in Computer Science 7795},
   journal = {Lecture Notes in Computer Science},
   volume = 2013,
 number = 0000,
   year = 2013,
   location = {Berlin Heidelberg, DE},
   publisher = {Springer Verlag},
   ISBN = {978-3-642-36742-7},
   ISSN = {0302-9743},
   language = {english},
   url = {http://www.fit.vutbr.cz/research/view_pub.php?id=10230}
}

Your IPv4 address: 18.232.124.77
Switch to https