Abstract
The size-change abstraction (SCA) is a popular program abstraction for termination analysis, and has been successfully implemented for imperative, functional and logic programs. Recently, it has been shown that SCA is also an attractive domain for the automatic analysis of the computational complexity of programs. In this paper, we provide asymptotically precise ranking functions for the special case of deterministic size-change systems. As a consequence we also obtain the result that the asymptotic complexity of deterministic size-change systems is exactly polynomial and that the exact integer exponent can be computed in PSPACE.
Cite
CITATION STYLE
Zuleger, F. (2015). Asymptotically precise ranking functions for deterministic size-change systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9139, pp. 426–442). Springer Verlag. https://doi.org/10.1007/978-3-319-20297-6_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
