A widening approach to multithreaded program verification
- Submitting institution
-
University of Oxford
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 1947
- Type
- D - Journal article
- DOI
-
10.1145/2629608
- Title of journal
- ACM Transactions on Programming Languages and Systems
- Article number
- ARTN 14
- First page
- 1
- Volume
- 36
- Issue
- 4
- ISSN
- 0164-0925
- Open access status
- Out of scope for open access requirements
- Month of publication
- October
- Year of publication
- 2014
- 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
-
2
- Research group(s)
-
-
- Citation count
- 16
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper has been significant for researchers working on the coverability problem of WSTs, or, equivalently, on reachability problems on Petri nets with no a-priori bound on the number of tokens per place (see e.g. Blondin et al., TACAS�16: https://doi.org/10.1007/978-3-662-49674-9_28; Schmitz, in ACM SIGLOG News, 2016: https://dl.acm.org/citation.cfm?id=2893585). To the best of our knowledge, every subsequent paper in this area has adopted our set of benchmarks to perform experimental evaluation of coverability checking algorithms.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -