Abstract
One of the difficulties of proving program termination is managing the subtle interplay between the finding of a termination argument and the finding of the argument's supporting invariant. In this paper we propose a new mechanism that facilitates better cooperation between these two types of reasoning. In an experimental evaluation we find that our new method leads to dramatic performance improvements. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Brockschmidt, M., Cook, B., & Fuhs, C. (2013). Better termination proving through cooperation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8044 LNCS, pp. 413–429). https://doi.org/10.1007/978-3-642-39799-8_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
