An analysis of the Podelski-Rybalchenko termination theorem via bar recursion
- Submitting institution
-
Queen Mary University of London
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 467
- Type
- D - Journal article
- DOI
-
10.1093/logcom/exv058
- Title of journal
- JOURNAL OF LOGIC AND COMPUTATION
- Article number
- -
- First page
- 555
- Volume
- 29
- Issue
- 4
- ISSN
- 0955-792X
- Open access status
- Out of scope for open access requirements
- Month of publication
- July
- Year of publication
- 2019
- 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
- 2
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The Podelski-Rybalchenko termination theorem is the basis for Microsoft's Terminator tool—the first model checker for program termination. The proof of correctness of Podelski-Rybalchenko theorem is ineffective relying on the non-computational infinite Ramsey’s theorem. Our paper presents the first computational (sub-recursive) interpretation of this proof based on a bar-recursive functional interpretation of Ramsey theorem. Paper is at the core of Silvia Steila's PhD thesis and contributed to her being offered a position at the Logic and Theory Group at Bern, where in 2017 she received the "Paul Bernays Award" by the Swiss Society for Logic and Philosophy of Science (http://www.sslps.unibe.ch/Bernays.html)
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -