Conditional Termination of Loops over Heap-Allocated Data


Downloads per month over past year




Downloads per month over past year

Albert Albiol, Elvira and Arenas Sánchez, Purificación and Genaim, Samir and Puebla, Germán and Román Díez, Guillermo (2014) Conditional Termination of Loops over Heap-Allocated Data. Science of computer programming, 92 (Part A). pp. 2-24. ISSN 0167-6423

[thumbnail of Conditional termination of loops.pdf]

Official URL:


Static analysis which takes into account the values of data stored in the heap is considered complex and computationally intractable in practice. Thus, most static analyzers do not keep track of object fields nor of array contents, i.e., they are heap-insensitive. In this article, we propose locality conditions for soundly tracking heap-allocated data in Java (bytecode) programs, by means of ghost non-heap allocated variables. This way, heap-insensitive analysis over the transformed program can infer information on the original heap-allocated data without sacrificing efficiency. If the locality conditions cannot be proven unconditionally, we seek to generate aliasing preconditions which, when they hold in the initial state, guarantee the termination of the program. Experimental results show that we greatly improve the accuracy w.r.t. a heap-insensitive analysis while the overhead introduced is reasonable.

Item Type:Article
Uncontrolled Keywords:Static Analysis, Heap-Sensitive Analysis, Termination, Java Bytecode, Program Transformation
Subjects:Sciences > Computer science
Sciences > Computer science > Operating systems
Sciences > Computer science > Software
ID Code:36390
Deposited On:07 Apr 2016 10:42
Last Modified:08 Apr 2016 08:08

Origin of downloads

Repository Staff Only: item control page