Parallel bug-finding in concurrent programs via reduced interleaving instances
Parallel bug-finding in concurrent programs via reduced interleaving instances
Concurrency poses a major challenge for program verification, but it can also offer an opportunity to scale when subproblems can be analysed in parallel. We exploit this opportunity here and use a parametrizable code-to-code translation to generate a set of simpler program instances, each capturing a reduced set of the original program’s interleavings. These instances can then be checked independently in parallel. Our approach does not depend on the tool that is chosen for the final analysis, is compatible with weak memory models, and amplifies the effectiveness of existing tools, making them find bugs faster and with fewer resources. We use Lazy-CSeq as an off-the-shelf final verifier to demonstrate that our approach is able, already with a small number of cores, to find bugs in the hardest known concurrency benchmarks in a matter of minutes, whereas other dynamic and static tools fail to do so in hours.
753-764
Nguyen Lam, Truc
0a373da7-0868-466d-a3b8-060868037acc
Schrammel, Peter
642a486a-f82b-47b7-be01-fd807cf039fa
Fischer, Bernd
0c9575e6-d099-47f1-b3a2-2dbc93c53d18
La Torre, Salvatore
46d2e62e-f7c3-4236-a323-1c1ab519279a
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923
30 October 2017
Nguyen Lam, Truc
0a373da7-0868-466d-a3b8-060868037acc
Schrammel, Peter
642a486a-f82b-47b7-be01-fd807cf039fa
Fischer, Bernd
0c9575e6-d099-47f1-b3a2-2dbc93c53d18
La Torre, Salvatore
46d2e62e-f7c3-4236-a323-1c1ab519279a
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923
Nguyen Lam, Truc, Schrammel, Peter, Fischer, Bernd, La Torre, Salvatore and Parlato, Gennaro
(2017)
Parallel bug-finding in concurrent programs via reduced interleaving instances.
Rosu, Grigore, Di Penta, Massimiliano and Nguyen, Tien N.
(eds.)
In ASE '17: Proceedings of the 32nd IEEE/ACM International Conference on Automated Software Engineering.
IEEE.
.
Record type:
Conference or Workshop Item
(Paper)
Abstract
Concurrency poses a major challenge for program verification, but it can also offer an opportunity to scale when subproblems can be analysed in parallel. We exploit this opportunity here and use a parametrizable code-to-code translation to generate a set of simpler program instances, each capturing a reduced set of the original program’s interleavings. These instances can then be checked independently in parallel. Our approach does not depend on the tool that is chosen for the final analysis, is compatible with weak memory models, and amplifies the effectiveness of existing tools, making them find bugs faster and with fewer resources. We use Lazy-CSeq as an off-the-shelf final verifier to demonstrate that our approach is able, already with a small number of cores, to find bugs in the hardest known concurrency benchmarks in a matter of minutes, whereas other dynamic and static tools fail to do so in hours.
Text
swarm-ASE2017
- Accepted Manuscript
More information
Accepted/In Press date: 18 July 2017
e-pub ahead of print date: 9 September 2017
Published date: 30 October 2017
Venue - Dates:
The 32nd IEEE/ACM International Conference on Automated Software Engineering, University of Illinois at Urbana-Champaign, Urbana, United States, 2017-10-30 - 2017-11-03
Identifiers
Local EPrints ID: 413917
URI: http://eprints.soton.ac.uk/id/eprint/413917
PURE UUID: a5230997-1cf9-4189-869f-d487edcf6d53
Catalogue record
Date deposited: 11 Sep 2017 16:31
Last modified: 15 Mar 2024 20:08
Export record
Contributors
Author:
Truc Nguyen Lam
Author:
Peter Schrammel
Author:
Bernd Fischer
Author:
Salvatore La Torre
Author:
Gennaro Parlato
Editor:
Grigore Rosu
Editor:
Massimiliano Di Penta
Editor:
Tien N. Nguyen
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