Albert Albiol, Elvira MaríaArenas Sánchez, PurificaciónGenaim, SamirPuebla, GermánRomán Díez, Guillermo2023-06-192023-06-192014-100167-642310.1016/j.scico.2013.04.006https://hdl.handle.net/20.500.14352/35134Static 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.engConditional Termination of Loops over Heap-Allocated Datajournal articlehttp://www.sciencedirect.com/science/article/pii/S0167642313001044open access004.451Static AnalysisHeap-Sensitive AnalysisTerminationJava BytecodeProgram TransformationInformática (Informática)Sistemas operativos (Ordenadores)Software1203.17 Informática3304.16 Diseño Lógico3304.16 Diseño Lógico