liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Memorax, a Precise and Sound Tool for Automatic Fence Insertion under TSO
Uppsala University, Sweden.
Uppsala University, Sweden.
Academia Sinica, Taiwan.
Uppsala University, Sweden.
Show others and affiliations
2013 (English)In: Tools and Algorithms for the Construction and Analysis of Systems: 19th International Conference, TACAS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings, Springer Berlin/Heidelberg, 2013, 530-536 p.Conference paper (Refereed)
Abstract [en]

We introduce MEMORAX, a tool for the verification of control state reachability (i.e., safety properties) of concurrent programs manipulating finite range and integer variables and running on top of weak memory models. The verification task is non-trivial as it involves exploring state spaces of arbitrary or even infinite sizes. Even for programs that only manipulate finite range variables, the sizes of the store buffers could grow unboundedly, and hence the state spaces that need to be explored could be of infinite size. In addition, MEMORAX in- corporates an interpolation based CEGAR loop to make possible the verification of control state reachability for concurrent programs involving integer variables. The reachability procedure is used to automatically compute possible memory fence placements that guarantee the unreachability of bad control states under TSO. In fact, for programs only involving finite range variables and running on TSO, the fence insertion functionality is complete, i.e., it will find all minimal sets of memory fence placements (minimal in the sense that removing any fence would result in the reachability of the bad control states). This makes MEMORAX the first freely available, open source, push-button verification and fence insertion tool for programs running under TSO with integer variables.

Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2013. 530-536 p.
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online) ; 7795
National Category
Computer Science
URN: urn:nbn:se:liu:diva-92596DOI: 10.1007/978-3-642-36742-7_37ISBN: 978-3-642-36741-0ISBN: 978-3-642-36742-7OAI: diva2:621306
The 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2013), Rome, Italy, March 16-24, 2013.
Available from: 2013-05-14 Created: 2013-05-14 Last updated: 2016-08-22

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Rezine, Ahmed
By organisation
Software and SystemsThe Institute of Technology
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 678 hits
ReferencesLink to record
Permanent link

Direct link