Handling loops in bounded model checking of C programs via k-induction
- Submitting institution
-
The University of Manchester
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 84840296
- Type
- D - Journal article
- DOI
-
10.1007/s10009-015-0407-9
- Title of journal
- International Journal on Software Tools for Technology Transfer
- Article number
- -
- First page
- 97
- Volume
- 19
- Issue
- 1
- ISSN
- 1433-2779
- Open access status
- Out of scope for open access requirements
- Month of publication
- November
- Year of publication
- 2015
- 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)
-
A - Computer Science
- Citation count
- 15
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- "This paper is the first software verifier to achieve unbounded verification of full ANSI-C programs, tackling memory safety issues, which is one of the significant sources of security vulnerabilities (https://www.zdnet.com/article/microsoft-70-percent-of-all-security-bugs-are-memory-safety-issues/).
This work received 12 awards in the SV-COMP, held at ETAPS/TACAS (https://ssvlab.github.io/esbmc/sv-comp.html).
Enabled funding:
- GBP1,000,000 EPSRC project EP/V000497/1
- EC project 957286 (EUR586,500)
- FAPEAM project 062.01722/2014 (BRL250,000)
- Industry-sponsored (contact: Head of General Retail and Management, Nokia Institute of Technology).
The code is on Github (https://github.com/esbmc/esbmc) and has 80 stars with 27 forked projects."
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
