Name
Abstract | ||
|---|---|---|
Stateless Model Checking (SMC) is a verification technique for concurrent programs that checks for safety violations by exploring all possible thread interleavings. SMC is usually coupled with Partial Order Reduction (POR), which exploits the independence of instructions to avoid redundant explorations when an equivalent one has already been considered. While effective POR techniques have been developed for many different memory models, they are only able to exploit independence at the instruction level, which makes them unsuitable for programs with coarse-grained synchronization mechanisms such as locks.
We present a lock-aware POR algorithm, LAPOR, that exploits independence at both instruction and critical section levels. This enables LAPOR to explore exponentially fewer interleavings than the state-of-the-art techniques for programs that use locks conservatively. Our algorithm is sound, complete, and optimal, and can be used for verifying programs under several different memory models. We implement LAPOR in a tool and show that it can be exponentially faster than the state-of-the-art model checkers.
|
Year | DOI | Venue |
|---|---|---|
2019 | 10.1145/3360599 | Proceedings of the ACM on Programming Languages |
Keywords | Field | DocType |
Model checking, mutual exclusion locks, weak memory models | Model checking,Lock (computer science),Computer science,Stateless protocol,Embedded system | Journal |
Volume | Issue | Citations |
3 | OOPSLA | 1 |
PageRank | References | Authors |
0.35 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michalis Kokologiannakis | 1 | 4 | 2.16 |
| Azalea Raad | 2 | 7 | 1.51 |
| Viktor Vafeiadis | 3 | 942 | 47.11 |