Just test what you cannot verify!
| dc.contributor.author | Czech, Mike | |
| dc.contributor.author | Jakobs, Marie-Christine | |
| dc.contributor.author | Wehrheim, Heike | |
| dc.contributor.editor | Knoop, Jens | |
| dc.contributor.editor | Zdun, Uwe | |
| dc.date.accessioned | 2017-06-21T07:37:17Z | |
| dc.date.available | 2017-06-21T07:37:17Z | |
| dc.date.issued | 2016 | |
| dc.description.abstract | Software verification is an established method to ensure software safety. Nevertheless, verification still often fails, either because it consumes too much resources, e.g., time or memory, or the technique is not mature enough to verify the property. Often then discarding the partial verification, the validation process proceeds with techniques like testing. To enable standard testing to profit from previous, partial verification, we use a summary of the verification effort to simplify the program for subsequent testing. Our techniques use this summary to construct a residual program which only contains program paths with unproven assertions. Afterwards, the residual program can be used with standard testing tools. Our first experiments show that testing profits from the partial verification. The test effort is reduced and combined verification and testing is faster than a complete verification. | en |
| dc.identifier.isbn | 978-3-88579-646-6 | |
| dc.identifier.pissn | 1617-5468 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e.V. | |
| dc.relation.ispartof | Software Engineering 2016 | |
| dc.relation.ispartofseries | Lecture Notes in Informatics (LNI) - Proceedings, Volume P-252 | |
| dc.title | Just test what you cannot verify! | en |
| dc.type | Text/Conference Paper | |
| gi.citation.endPage | 18 | |
| gi.citation.publisherPlace | Bonn | |
| gi.citation.startPage | 17 | |
| gi.conference.date | 23.-26. Februar 2016 | |
| gi.conference.location | Wien |
Dateien
Originalbündel
1 - 1 von 1