Bit-Precise Procedure-Modular Termination Analysis
- Submitting institution
-
University of Bristol
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 232650905
- Type
- D - Journal article
- DOI
-
10.1145/3121136
- Title of journal
- ACM Transactions on Programming Languages and Systems
- Article number
- 1
- First page
- -
- Volume
- 40
- Issue
- 1
- ISSN
- 0164-0925
- Open access status
- Not compliant
- Month of publication
- December
- 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
-
4
- Research group(s)
-
D - Fundamentals of Computing
- Citation count
- 1
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This work is novel in synthesising interprocedural summaries for proving termination and a substantially extended version of ASE'15 (19 citations). The theoretical contributions and corresponding tool, 2LS, influenced subsequent works (e.g., [Malik et al.,TACAS'18], [Madhukar et al.,ATVA'17]). Furthermore, the proposed tool, 2LS, was frequently used as a reference point (e.g., [Xie et al.,ESEC/FSE'17], [Rocco De Nicola et al.,Science of Computer Programming'20]), while also winning third place (out of 28 participants) in the corresponding termination category of the Competition on Software Verification'20 (https://sv-comp.sosy-lab.org/2020/). This work also partially contributed to obtaining funding for a PhD studentship RGF\R1\181003 (PI:David).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -