Anzeige
Erschienen in:
2006 | OriginalPaper | Buchkapitel
Verifying Concurrent Message-Passing C Programs with Recursive Calls
verfasst von : S. Chaki, E. Clarke, N. Kidd, T. Reps, T. Touili
Erschienen in: Tools and Algorithms for the Construction and Analysis of Systems
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.