Towards counterexample-guided k-induction for fast bug detection
Towards counterexample-guided k-induction for fast bug detection
Recently, the k-induction algorithm has proven to be a successful approach for both finding bugs and proving correctness. However, since the algorithm is an incremental approach, it might waste resources trying to prove incorrect programs. In this paper, we extend the k-induction algorithm to shorten the number of steps required to find a property violation. We convert the algorithm into a meet-in-the-middle bidirectional search algorithm, using the counterexample produced from over-approximating the program. The main advantage is in the reduction of the state explosion by reducing the maximum required steps from k to ⌊k/2 + 1⌋.
765-769
Association for Computing Machinery
Gadelha, Mikhail R.
61c56e79-5115-4277-b1be-f479d40959a4
R. Monteiro, Felipe
da74ad90-fd3d-4087-9252-bdc3ef5b49ad
Cordeiro, Lucas
fc7cb054-f39e-4013-9faa-a471bd006596
Nicole, Denis
0aca6dd1-833f-4544-b7a4-58fb91c7395a
26 October 2018
Gadelha, Mikhail R.
61c56e79-5115-4277-b1be-f479d40959a4
R. Monteiro, Felipe
da74ad90-fd3d-4087-9252-bdc3ef5b49ad
Cordeiro, Lucas
fc7cb054-f39e-4013-9faa-a471bd006596
Nicole, Denis
0aca6dd1-833f-4544-b7a4-58fb91c7395a
Gadelha, Mikhail R., R. Monteiro, Felipe, Cordeiro, Lucas and Nicole, Denis
(2018)
Towards counterexample-guided k-induction for fast bug detection.
In ESEC/FSE 2018 Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering.
Association for Computing Machinery.
.
(doi:10.1145/3236024.3264840).
Record type:
Conference or Workshop Item
(Paper)
Abstract
Recently, the k-induction algorithm has proven to be a successful approach for both finding bugs and proving correctness. However, since the algorithm is an incremental approach, it might waste resources trying to prove incorrect programs. In this paper, we extend the k-induction algorithm to shorten the number of steps required to find a property violation. We convert the algorithm into a meet-in-the-middle bidirectional search algorithm, using the counterexample produced from over-approximating the program. The main advantage is in the reduction of the state explosion by reducing the maximum required steps from k to ⌊k/2 + 1⌋.
This record has no associated files available for download.
More information
Accepted/In Press date: 1 January 2018
e-pub ahead of print date: 26 October 2018
Published date: 26 October 2018
Identifiers
Local EPrints ID: 426953
URI: http://eprints.soton.ac.uk/id/eprint/426953
PURE UUID: 7b5e0543-5142-45ea-92a7-e68083d48180
Catalogue record
Date deposited: 19 Dec 2018 17:30
Last modified: 15 Mar 2024 23:26
Export record
Altmetrics
Contributors
Author:
Mikhail R. Gadelha
Author:
Felipe R. Monteiro
Author:
Lucas Cordeiro
Author:
Denis Nicole
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics