Formal Verification of an Executable LTL Model Checker with Partial Order Reduction
- Submitting institution
-
The University of Manchester
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 118363871
- Type
- D - Journal article
- DOI
-
10.1007/s10817-017-9418-4
- Title of journal
- Journal of Automated Reasoning
- Article number
- -
- First page
- 3
- Volume
- 60
- Issue
- 1
- ISSN
- 0168-7433
- Open access status
- Deposit exception
- Month of publication
- June
- Year of publication
- 2017
- URL
-
-
- 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
-
1
- Research group(s)
-
A - Computer Science
- Citation count
- 4
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- "This paper uses automated checking to identify a gap in the long-standing standard proof of ""partial order reduction"", a ubiquitous algorithm implemented in model-checking software used across academia and industry.
Siegel subsequently showed how the algorithm is flawed. As a practical consequence, this affects the implementation in the widely used SPIN model checker [Siegel. What’s Wrong with On-the-Fly Partial Order Reduction. CAV''2019].
Enabled funding of EUR540,000 German Research Council Grant (KR 4890/1-1, LA 3292/1-1) ""Verifizierte Model Checker""."
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
