Bit-precise procedure-modular termination analysis
- Submitting institution
-
University of Oxford
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 2022
- Type
- D - Journal article
- DOI
-
10.1145/3121136
- Title of journal
- ACM Transactions on Programming Languages and Systems
- Article number
- 1
- First page
- 1
- Volume
- 40
- Issue
- 1
- ISSN
- 0164-0925
- 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
- While the program termination problem has been widely discussed in academic literature, two aspects which are prerequisites for impact on practitioners have been neglected. This paper presents the only program termination algorithm to date that uses faithful semantics for the overflow and wrap-around semantics of integers in C/C++ and Java programs. Furthermore, it is the first modular approach, which is essential to make such analyses scale .
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -