Institutional Repository
| Termination analysis with recursive calling graphs | |
| Long, T; Zhang, WH | |
| 2016 | |
| Source | JOURNAL OF NETWORK AND COMPUTER APPLICATIONS
 |
| ISSN | 1084-8045 |
| Volume | 59Pages:109-116 |
| English Abstract | 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.; 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. |
| Indexed Type | SCI |
| Keyword | Termination Analysis Green Software Programs Size-change Termination Principle |
| Department | China Univ Geosci, Sch Informat Engn, Beijing, Peoples R China. Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing, Peoples R China. |
| Language | 英语 |
| WOS ID | WOS:000367491600012 |
| Citation statistics | |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/17417 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Long, T,Zhang, WH. Termination analysis with recursive calling graphs[J]. JOURNAL OF NETWORK AND COMPUTER APPLICATIONS,2016,59:109-116. |
| APA | Long, T,&Zhang, WH.(2016).Termination analysis with recursive calling graphs.JOURNAL OF NETWORK AND COMPUTER APPLICATIONS,59,109-116. |
| MLA | Long, T,et al."Termination analysis with recursive calling graphs".JOURNAL OF NETWORK AND COMPUTER APPLICATIONS 59(2016):109-116. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| 1-s2.0-S108480451500（426KB） | 开放获取 | License | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment