Show simple item record

dc.contributor.authorCzech, Mike
dc.contributor.authorJakobs, Marie-Christine
dc.contributor.authorWehrheim, Heike
dc.contributor.editorKnoop, Jens
dc.contributor.editorZdun, Uwe
dc.date.accessioned2017-06-21T07:37:17Z
dc.date.available2017-06-21T07:37:17Z
dc.date.issued2016
dc.identifier.isbn978-3-88579-646-6
dc.identifier.issn1617-5468
dc.description.abstractSoftware 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.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofSoftware Engineering 2016
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-252
dc.titleJust test what you cannot verify!en
dc.typeText/Conference Paper
dc.pubPlaceBonn
mci.reference.pages17-18
mci.conference.locationWien
mci.conference.date23.-26. Februar 2016


Files in this item

Thumbnail

Show simple item record