Effective Bounds on the Podelski-Rybalchenko Termination Theorem
Authors: Stefano Berardi, Paulo Oliva and Silvia Steila
Paper Information
| Title: | Effective Bounds on the Podelski-Rybalchenko Termination Theorem |
| Authors: | Stefano Berardi, Paulo Oliva and Silvia Steila |
| Proceedings: | PSC 2014 Abstracts |
| Editors: | Peter Schuster, Dirk Pattinson and Ana Sokolova |
| Keywords: | Termination Theorem, Bar recursion, Ramsey Theorem, Intuitionism |
| Abstract: | ABSTRACT. We report here on current work towards an effective proof (with explicit bounds) of Podelski and Rybalchenko Termination Theorem [1]. Our long-term project is to obtain a priori-bounds for the termination of computer programs, and compare these with bounds obtained via other intuitionistic proofs of the Termination Theorem. References 1. Andreas Podelski and Andrey Rybalchenko. Transition invariants. In LICS, pages 32-41, 2004. |
| Pages: | 0 |
| Talk: | Jul 17 15:15 |
| Paper: |  |