Automatic fence insertion in integer programs via predicate abstraction
2012 (English)In: Static Analysis: 19th International Symposium, SAS 2012, Deauville, France, September 11-13, 2012. Proceedings / [ed] Antoine Miné, David Schmidt, Springer Berlin/Heidelberg, 2012, 164-180 p.Conference paper (Refereed)
We propose an automatic fence insertion and verification framework for concurrent programs running under relaxed memory. Unlike previous approaches to this problem, which allow only variables of finite domain, we target programs with (unbounded) integer variables. The problem is difficult because it has two different sources of infiniteness: unbounded store buffers and unbounded integer variables. Our framework consists of three main components: (1) a finite abstraction technique for the store buffers, (2) a finite abstraction technique for the integer variables, and (3) a counterexample guided abstraction refinement loop of the model obtained from the combination of the two abstraction techniques. We have implemented a prototype based on the framework and run it successfully on all standard benchmarks together with several challenging examples that are beyond the applicability of existing methods.
Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2012. 164-180 p.
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online) ; 7460
IdentifiersURN: urn:nbn:se:liu:diva-117911DOI: 10.1007/978-3-642-33125-1_13ISI: 000342807500013ISBN: 978-3-642-33124-4 (print)ISBN: 978-3-642-33125-1 (Online)OAI: oai:DiVA.org:liu-117911DiVA: diva2:811891
19th International Symposium, SAS 2012, Deauville, France, September 11-13, 2012
FunderSwedish Research Council