Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/83951
Type: | Conference paper |
Title: | Heuristically creating test cases for program verification systems |
Author: | Beckert, B. Bormer, M. Wagner, M. |
Citation: | Proceedings of the 10th Metaheuristics International Conference, MIC2013: pp.37-46 |
Publisher: | Singapore Management University |
Publisher Place: | online |
Issue Date: | 2013 |
Conference Name: | Metaheuristics International Conference (10th : 2013 : Singapore) |
Statement of Responsibility: | Bernhard Beckert, Thorsten Bormer, Markus Wagner |
Abstract: | The correctness of program verification systems is of great importance, as they are used to formally prove that safety- and security-critical programs follow their specification. This correctness needs to be checked and demonstrated to users and certification agencies. One of the contributing factors to the correctness of the whole verification system is the correctness of the background axiomatization, which captures the semantics of the target program language. We present an optimisation framework for the maximization of the proportion of the axiomatization that is used (“covered”) during testing of the verification tool. We show how test cases for regression tests can be created based on existing ones, as the initial creation of test cases is a very time consuming process. Our study shows that the combination of different heuristics leads to a diverse set of test cases, which in turn increases the axiomatization coverage. This translates into a significant increase in trust in the program verification system. |
Rights: | Copyright status unknown |
Appears in Collections: | Aurora harvest Computer Science publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.