Name
Abstract | ||
|---|---|---|
A major issue in the activity of deductive program verification is the understanding of the reason why a proof fails. To help the user understand the problem and decide what needs to be fixed in the code or the specification, it is essential to provide means to investigate such a failure. We present our approach for the design and the implementation of counterexample generation within the SPARK 2014 environment, exhibiting values for the variables of the program where a given part of the specification fails to be validated. To produce a counterexample, we exploit the ability of SMT solvers to propose, when a proof of a formula is not found, a counter-model. Turning such a counter-model into a counterexample for the initial program is not trivial because of the many transformations leading from a given code and specification to a verification condition. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-41591-8_15 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Spark (mathematics),Programming language,Computer science,Algorithm,Real-time computing,Exploit,Loop invariant,Counterexample,Intermediate language | Conference | 9763 |
ISSN | Citations | PageRank |
0302-9743 | 4 | 0.41 |
References | Authors | |
16 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David Hauzar | 1 | 4 | 0.41 |
| Claude Marché | 2 | 814 | 47.43 |
| Yannick Moy | 3 | 69 | 9.25 |