Name
Abstract | ||
|---|---|---|
When using formal verification on critical software, an important question involves whether the properties used for analysis are sufficient to adequately constrain the behavior of an implementation model. To address this question, coverage metrics for property-based formal verification have been proposed. Existing metrics are usually based on mutation, where the implementation model is repeatedly modified and re-analyzed to determine whether mutant models are ``killed'' by the property set. These metrics tend to be very expensive to compute, as they involve many additional verification problems. This paper proposes an alternate family of metrics that can be computed using the recently introduced idea of Inductive Validity Cores (IVCs). IVCs determine a minimal set of model elements necessary to establish a proof. One of the proposed metrics is both rigorous and substantially cheaper to compute than mutation-based metrics. In addition, unlike the mutation-based techniques, the design elements marked as necessary by the metric are guaranteed to preserve provability. We demonstrate the metrics on a large corpus of examples.
|
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/ASE.2017.8115632 | ASE |
Keywords | Field | DocType |
Coverage, requirements completeness, formal verification, inductive proofs, inductive validity cores | Design elements and principles,Computer science,Theoretical computer science,Software,Formal methods,Formal verification | Conference |
ISSN | ISBN | Citations |
1527-1366 | 978-1-5386-2684-9 | 4 |
PageRank | References | Authors |
0.41 | 19 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Elaheh Ghassabani | 1 | 18 | 2.72 |
| Andrew Gacek | 2 | 252 | 16.87 |
| Michael W. Whalen | 3 | 1096 | 70.54 |
| Mats P.E. Heimdahl | 4 | 192 | 9.66 |
| Lucas G. Wagner | 5 | 8 | 0.85 |