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

Direct link
Counting dynamically synchronizing processes
Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering.
Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering.
Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering.
Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering.
2016 (English)In: International Journal on Software Tools for Technology Transfer (STTT), ISSN 1433-2779, E-ISSN 1433-2787, 1-18 p.Article in journal (Refereed) Epub ahead of print
Abstract [en]

We address the problem of automatically establishing correctness for programs generating an arbitrary number of concurrent processes and manipulating variables ranging over an infinite domain. The programs we consider can make use of the shared variables to count and synchronize the spawned processes. This allows them to implement intricate synchronization mechanisms, such as barriers. Automatically verifying correctness, and deadlock freedom, of such programs is beyond the capabilities of current techniques. For this purpose, we make use of counting predicates that mix counters referring to the number of processes satisfying certain properties and variables directly manipulated by the concurrent processes. We then combine existing works on counter, predicate, and constrained monotonic abstraction and build a nested counter example based refinement scheme for establishing correctness (expressed as non-reachability of configurations satisfying counting predicates formulas). We have implemented a tool (Pacman, for predicated constrained monotonic abstraction) and used it to perform parameterized verification on several programs whose correctness crucially depends on precisely capturing the number of processes synchronizing using shared variables.

Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2016. 1-18 p.
Keyword [en]
Parameterized verification, Counting predicate, Barrier synchronization, Deadlock freedom, Multithreaded programs, Counter abstraction, Predicate abstraction, Constrained monotonic abstraction
National Category
Computer Science
Identifiers
URN: urn:nbn:se:liu:diva-124406DOI: 10.1007/s10009-015-0411-0OAI: oai:DiVA.org:liu-124406DiVA: diva2:898584
Available from: 2016-01-28 Created: 2016-01-28 Last updated: 2016-03-14

Open Access in DiVA

The full text will be freely available from 2017-01-17 09:14
Available from 2017-01-17 09:14

Other links

Publisher's full text

Search in DiVA

By author/editor
Ganjei, ZeinabRezine, AhmedEles, PetruPeng, Zebo
By organisation
Software and SystemsFaculty of Science & Engineering
In the same journal
International Journal on Software Tools for Technology Transfer (STTT)
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: 567 hits
ReferencesLink to record
Permanent link

Direct link