Linear-Time model-checking for multithreaded programs under scope-bounding

  • Authors:

  • Mohamed Faouzi Atig;Ahmed Bouajjani;K. Narayan Kumar;Prakash Saivasan

  • Affiliations:

  • Uppsala University, Sweden;LIAFA, Université Paris Diderot, France;Chennai Mathematical Institute, India;Chennai Mathematical Institute, India

  • Venue:
  • ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

We address the model checking problem of omega-regular linear-time properties for shared memory concurrent programs modeled as multi-pushdown systems. We consider here boolean programs with a finite number of threads and recursive procedures. It is well-known that the model checking problem is undecidable for this class of programs. In this paper, we investigate the decidability and the complexity of this problem under the assumption of scope-boundedness defined recently by La Torre and Napoli in [24]. A computation is scope-bounded if each pair of call and return events of a procedure executed by some thread must be separated by a bounded number of context-switches of that thread. The concept of scope-bounding generalizes the one of context-bounding [31] since it allows an unbounded number of context switches. Moreover, while context-bounding is adequate for reasoning about safety properties, scope-bounding is more suitable for reasoning about liveness properties that must be checked over infinite computations. It has been shown in [24] that the reachability problem for multi-pushdown systems under scope-bounding is PSPACE-complete. We prove in this paper that model-checking linear-time properties under scope-bounding is also decidable and is EXPTIME-complete.