Name
Abstract | ||
|---|---|---|
We present a technique for efficient stateless model checking of programs that execute under the relaxed memory models TSO and PSO. The basis for our technique is a novel representation of executions under TSO and PSO, called chronological traces. Chronological traces induce a partial order relation on relaxed memory executions, capturing dependencies that are needed to represent the interaction via shared variables. They are optimal in the sense that they only distinguish computations that are inequivalent under the widely-used representation by Shasha and Snir. This allows an optimal dynamic partial order reduction algorithm to explore a minimal number of executions while still guaranteeing full coverage. We apply our techniques to check, under the TSO and PSO memory models, LLVM assembly produced for C/pthreads programs. Our experiments show that our technique reduces the verification effort for relaxed memory models to be almost that for the standard model of sequential consistency. In many cases, our implementation significantly outperforms other comparable tools. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/s00236-016-0275-0 | Acta Inf. |
Keywords | DocType | Volume |
software engineering | Journal | 54 |
Issue | ISSN | Citations |
8 | 1432-0525 | 24 |
PageRank | References | Authors |
1.04 | 33 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Parosh Aziz Abdulla | 1 | 2010 | 122.22 |
| Stavros Aronis | 2 | 98 | 6.89 |
| Mohamed Faouzi Atig | 3 | 505 | 40.94 |
| bengt jonsson | 4 | 3637 | 263.46 |
| Carl Leonardsson | 5 | 98 | 5.34 |
| Konstantinos F. Sagonas | 6 | 477 | 43.49 |