Name
Abstract | ||
|---|---|---|
Model checking using GPUs has seen increased popularity over the last years. Because GPUs have a limited amount of memory, only small to medium-sized systems can be verified. For on-the-fly explicitstate model checking, we improve memory efficiency by applying partialorder reduction. We propose novel parallel algorithms for three practical approaches to partial-order reduction. Correctness of the algorithms is proved using a new, weaker version of the cycle proviso. Benchmarks show that our implementation achieves a reduction similar to or better than the state-of-the-art techniques for CPUs, while the amount of runtime overhead is acceptable. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-46520-3_23 | Lecture Notes in Computer Science |
DocType | Volume | ISSN |
Conference | 9938 | 0302-9743 |
Citations | PageRank | References |
1 | 0.35 | 21 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Neele | 1 | 2 | 1.72 |
| Anton Wijs | 2 | 203 | 22.84 |
| Dragan Bosnacki | 3 | 276 | 26.95 |
| Jaco Van De Pol | 4 | 1022 | 78.19 |