A Multi-Domain Incremental Analysis Engine and its Application to Incremental Resource Analysis


Downloads per month over past year




Downloads per month over past year

Albert Albiol, Elvira and Correas Fernández, Jesús and Puebla, Germán and Román Díez, Guillermo (2015) A Multi-Domain Incremental Analysis Engine and its Application to Incremental Resource Analysis. Theoretical Computer Science, 585 (20). pp. 91-114. ISSN 0304-3975

[thumbnail of A multi-domain.pdf]

Official URL: http://www.sciencedirect.com/science/article/pii/S0304397515001954


The aim of incremental analysis is, given a program, its analysis results, and a series of changes to the program, to obtain the new analysis results as eficiently as possible and, ideally, without having to (re-)analyze fragments of code which are not affected by the changes. Incremental analysis can significantly reduce both the time and the memory requirements of analysis. The first contribution of this article is a multi-domain incremental fixed-point algorithm for a sequential Java-like language. The algorithm is multi-domain in the sense that it interleaves the (re-)analysis for multiple domains by taking into account dependencies among them. Importantly, this allows the incremental analyzer to invalidate only those analysis results previously inferred by certain dependent domains. The second contribution is an incremental resource usage analysis which, in its first phase, uses the multi-domain incremental fixed-point algorithm to carry out all global pre-analyses required to infer cost in an interleaved way. Such resource analysis is parametric on the cost metrics one wants to measure (e.g., number of executed instructions, number of objects created, etc.). Besides, we present a novel form of cost summaries which allows us to incrementally reconstruct only those components of cost functions affected by the changes. Experimental results in the costa system show that the proposed incremental analysis provides significant performance gains, ranging from a speedup of 1.48 up to 5.13 times faster than non-incremental analysis.

Item Type:Article
Subjects:Sciences > Computer science > Software
ID Code:36256
Deposited On:07 Apr 2016 10:38
Last Modified:08 Apr 2016 08:12

Origin of downloads

Repository Staff Only: item control page