Name
Abstract | ||
|---|---|---|
We present GenMC, a model checking algorithm for concurrent programs that is parametric in the choice of memory model and can be used for verifying clients of concurrent libraries. Subject to a few basic conditions about the memory model, our algorithm is sound, complete and optimal, in that it explores each consistent execution of the program according to the model exactly once, and does not explore inconsistent executions or embark on futile exploration paths. We implement GenMC as a tool for verifying C programs. Despite the generality of the algorithm, its performance is comparable to the state-of-art specialized model checkers for specific memory models, and in certain cases exponentially faster thanks to its coarse partitioning of executions.
|
Year | DOI | Venue |
|---|---|---|
2019 | 10.1145/3314221.3314609 | Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation |
Keywords | Field | DocType |
Model checking, weak memory models | Model checking,Computer science,Theoretical computer science | Conference |
ISBN | Citations | PageRank |
978-1-4503-6712-7 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michalis Kokologiannakis | 1 | 4 | 2.16 |
| Azalea Raad | 2 | 40 | 6.42 |
| Viktor Vafeiadis | 3 | 942 | 47.11 |