Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/108008
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Type: | Conference paper |
Title: | Speeding up the proof strategy in formal software verification |
Author: | Wagner, M. |
Citation: | - Proceedings of the 2016 Genetic and Evolutionary Computation Conference Companion, 2016 / Friedrich, T. (ed./s), pp.1137-1138 |
Publisher: | ACM press |
Issue Date: | 2016 |
ISBN: | 9781450343237 |
Conference Name: | Genetic and Evolutionary Computation Conference (GECCO) (20 Jul 2016 - 24 Jul 2016 : Denver, CO) |
Editor: | Friedrich, T. |
Statement of Responsibility: | Markus Wagner |
Abstract: | The functional correctness of safety- and security-critical software is of utmost importance. Nowadays, this can be achieved through computer assisted verification. While formal verification itself typically poses a steep learning-curve for anyone who wants to apply it, its applicability is further hindered by its (typically) low runtime performance. With the increasing popularity of algorithm parameter tuning and genetic improvement, we see a great opportunity for assisting verification engineers in their daily tasks. |
Keywords: | Formal software verification; search-based software engineering; runtime improvement |
Rights: | © 2016 ACM |
DOI: | 10.1145/2908961.2931690 |
Published version: | http://dx.doi.org/10.1145/2908961.2931690 |
Appears in Collections: | Aurora harvest 3 Computer Science publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
RA_hdl_108008.pdf Restricted Access | Restricted Access | 147.87 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.