.png){kind=icon}
.png){kind=icon}
Return
Termination analysis with recursive calling graphs
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jnca.2015.06.019.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
As one of the significant aspects for green software systems, termination analysis is related to the optimization of the resource utilization. The approach for size-change termination principle was first proposed by Lee, Jones and Ben-Amram in 2001, which is an effective method for automatic termination analysis. According to its abstracted constructs (size-change graphs), the principle ignores the condition and return values for function call. In this paper, we devise a new construct including the ignoring features to extend the set of programs that are size-change terminating in real life. The main contribution of our paper is twofold: firstly, it supports the analysis of functions in which the returned values are relevant to termination. Secondly, it gains more accuracy for oscillating value change in termination analysis. (C) 2015 Elsevier Ltd. All rights reserved.
Keywords:
Termination analysis
Green software programs
Size-change termination principle
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8
Papers:
3.6K
Citations:
1.1W