The University of Southampton
University of Southampton Institutional Repository

Towards counterexample-guided k-induction for fast bug detection

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
ACM
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.
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. ACM. pp. 765-769 . (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⌋.

Full text not available from this repository.

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: 06 Oct 2020 16:59

Export record

Altmetrics

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×