Name
Abstract | ||
|---|---|---|
One of the most successful techniques for refuting safety properties is to find counterexamples by bounded model checking. However, for large programs, bounded model checking instances often exceed the limits of resources available. Generating such counterexamples in a modular way could speed up refutation, but it is challenging because of the inherently non-compositional nature of these counterexamples. We start from the monolithic safety verification problem and present a step-by-step derivation of the compositional safety refutation problem. We give three algorithms that solve this problem, discuss their properties with respect to efficiency and completeness, and evaluate them experimentally. |
Year | Venue | Field |
|---|---|---|
2017 | ATVA | Model checking,Computer science,Theoretical computer science,Modular design,Counterexample,Completeness (statistics),Speedup,Bounded function |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
17 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kumar Madhukar | 1 | 1 | 0.70 |
| Peter Schrammel | 2 | 134 | 19.10 |
| Mandayam Srivas | 3 | 2 | 1.86 |