Name
Abstract | ||
|---|---|---|
Symbolic model checking of parallel programs stands and falls with effective methods of dealing with the explosion of interleavings. We propose a dynamic reduction technique to avoid unnecessary interleavings. By extending Lipton's original work with a notion of bisimilarity, we accommodate dynamic transactions, and thereby reduce dependence on the accuracy of static analysis, which is a severe bottleneck in other reduction techniques.The combination of symbolic model checking and dynamic reduction techniques has proven to be challenging in the past. Our generic reduction theorem nonetheless enables us to derive an efficient symbolic encoding, which we implemented for IC3 and BMC. The experiments demonstrate the power of dynamic reduction on several case studies and a large set of SVCOMP benchmarks. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-52234-0_14 | VERIFICATION, MODEL CHECKING, AND ABSTRACT INTERPRETATION, VMCAI 2017 |
DocType | Volume | ISSN |
Conference | 10145 | 0302-9743 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Henning Günther | 1 | 1 | 0.69 |
| alfons laarman | 2 | 266 | 14.17 |
| Ana Sokolova | 3 | 254 | 18.88 |
| Georg Weissenbacher | 4 | 271 | 22.71 |