Bound analysis of imperative programs with the size-change abstraction

69Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The size-change abstraction (SCA) is an important program abstraction for termination analysis, which has been successfully implemented in many tools for functional and logic programs. In this paper, we demonstrate that SCA is also a highly effective abstract domain for the bound analysis of imperative programs. We have implemented a bound analysis tool based on SCA for imperative programs. We abstract programs in a pathwise and context dependent manner, which enables our tool to analyze real-world programs effectively. Our work shows that SCA captures many of the essential ideas of previous termination and bound analysis and goes beyond in a conceptually simpler framework. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Zuleger, F., Gulwani, S., Sinn, M., & Veith, H. (2011). Bound analysis of imperative programs with the size-change abstraction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6887 LNCS, pp. 280–297). https://doi.org/10.1007/978-3-642-23702-7_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free