uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
The Benefits of Duality in Verifying Concurrent Programs under TSO
(Datorteknik, Computer Systems)
(Datorteknik, Computer Systems)
(Datorteknik, Computer Systems)
2016 (English)In: The 27th International Conference on Concurrency Theory, 2016Conference paper (Refereed)
Abstract [en]

We address the problem of verifying safety properties of concurrent programs running over the TSO memory model. Known decision procedures for this model are based on complex encodings of store buffers as lossy channels. These procedures assume that the number of processes is fixed. However, it is important in general to prove correctness of a system/algorithm in a parametric way with an arbitrarily large number of processes. In this paper, we introduce an alternative (yet equivalent) semantics to the classical one for the TSO model that is more amenable for efficient algorithmic verification and for extension to parametric verification. For that, we adopt a dual view where load buffers are used instead of store buffers. The flow of information is now from the memory to load buffers. We show that this new semantics allows (1) to simplify drastically the safety analysis under TSO, (2) to obtain a spectacular gain in efficiency and scalability compared to existing procedures, and (3) to extend easily the decision procedure to the parametric case, which allows to obtain a new decidability result, and more importantly, a verification algorithm that is more general and more efficient in practice than the one for bounded instances.

Place, publisher, year, edition, pages
2016.
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:uu:diva-298663OAI: oai:DiVA.org:uu-298663DiVA: diva2:946791
Conference
CONCUR2016
Projects
UPMARC
Available from: 2016-07-06 Created: 2016-07-06 Last updated: 2016-07-07

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Abdulla, Parosh AzizAtig, Mohamed FaouziNgo, Tuan Phong
Computer Systems

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

Total: 36 hits
ReferencesLink to record
Permanent link

Direct link