Chapter

Tools and Algorithms for the Construction and Analysis of Systems

Volume 3920 of the series Lecture Notes in Computer Science pp 334-349

Verifying Concurrent Message-Passing C Programs with Recursive Calls

  • S. ChakiAffiliated withCarnegie Mellon University
  • , E. ClarkeAffiliated withCarnegie Mellon University
  • , N. KiddAffiliated withUniversity of Wisconsin
  • , T. RepsAffiliated withUniversity of Wisconsin
  • , T. TouiliAffiliated withLIAFA, CNRS & University of Paris 7

Abstract

We consider the model-checking problem for C programs with (1) data ranging over very large domains, (2) (recursive) procedure calls, and (3) concurrent parallel components that communicate via synchronizing actions. We model such programs using communicating pushdown systems, and reduce the reachability problem for this model to deciding the emptiness of the intersection of two context-free languages L 1 and L 2. We tackle this undecidable problem using a CounterExample Guided Abstraction Refinement (CEGAR) scheme. We implemented our technique in the model checker MAGIC and found a previously unknown bug in a version of a Windows NT Bluetooth driver.