Effective verification for low-level software with competing interrupts
- Submitting institution
-
Queen Mary University of London
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 496
- Type
- D - Journal article
- DOI
-
10.1145/3147432
- Title of journal
- ACM Transactions on Embedded Computing Systems
- Article number
- 2
- First page
- 1
- Volume
- 17
- Issue
- 2
- ISSN
- 1558-3465
- Open access status
- Compliant
- Month of publication
- January
- Year of publication
- 2018
- 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
-
4
- Research group(s)
-
-
- Citation count
- 1
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- "Interrupts are a major correctness concern for low-level software, exhibiting
similar problems as lock-free concurrent programs. In this paper we prove how
the formal models behind interrupts and concurrency relate, and provide an
efficient implementation to address the automated analysis. This work addresses
a problem raised by Intel in 2011 and was funded by Intel with 1.3 million USD. It furthermore led to collaboration with Paul McKenney (paulmck@kernel.org) to integrate our automated analysis into the Linux kernel's RCU component."
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -