Synchronisation- and Reversal-Bounded Analysis of Multithreaded Programs with Counters

  • Matthew Hague
  • Anthony Widjaja Lin
Conference paper

DOI: 10.1007/978-3-642-31424-7_22

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7358)
Cite this paper as:
Hague M., Lin A.W. (2012) Synchronisation- and Reversal-Bounded Analysis of Multithreaded Programs with Counters. In: Madhusudan P., Seshia S.A. (eds) Computer Aided Verification. CAV 2012. Lecture Notes in Computer Science, vol 7358. Springer, Berlin, Heidelberg

Abstract

We study a class of concurrent pushdown systems communicating by both global synchronisations and reversal-bounded counters, providing a natural model for multithreaded programs with procedure calls and numeric data types. We show that the synchronisation-bounded reachability problem can be efficiently reduced to the satisfaction of an existential Presburger formula. Hence, the problem is NP-complete and can be tackled with efficient SMT solvers such as Z3. In addition, we present optimisations to make our reduction practical, e.g., heuristics for removing or merging transitions in our models. We provide optimised algorithms and a prototypical implementation of our results and perform preliminary experiments on examples derived from real-world problems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Matthew Hague
    • 1
    • 2
    • 3
  • Anthony Widjaja Lin
    • 3
  1. 1.LIGMUniversité Paris-EstFrance
  2. 2.LIAFAUniversité Paris Diderot & CNRSFrance
  3. 3.Department of Computer ScienceOxford UniversityUSA

Personalised recommendations