Parallel bug-finding in concurrent programs via reduced interleaving instances
- Submitting institution
-
University of Sussex
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 384323_70188
- Type
- E - Conference contribution
- DOI
-
10.1109/ASE.2017.8115686
- Title of conference / published proceedings
- Automated Software Engineering
- First page
- 753
- Volume
- -
- Issue
- -
- ISSN
- 0928-8910
- Open access status
- Compliant
- Month of publication
- October
- Year of publication
- 2017
- URL
-
https://dl.acm.org/citation.cfm?id=3155656
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
4
- Research group(s)
-
-
- Citation count
- 4
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper concretises the idea of “swarm verification” that has been around for more than a decade, but not successfully exploited. We develop a technique for the verification of concurrent programs that allows a continuous adjustment of the trade-off between full coverage single-process analysis (complete and slow) and partial coverage multi-process analysis ("testing", incomplete and fast). We show that the technique is unparalleled in the detection of rare concurrency bugs within minutes that take many hours to find in a full analysis and are extremely unlikely to be found with testing. Field-weighted citation impact 2.29 (Scopus).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -