Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/61292
Title: A new method to encode calling contexts with recursions
Authors: Wang, L
Li, B
Leung, H 
Keywords: Call graph
Calling context encoding
Dynamic analysis
Profiling
Recursive calls
Issue Date: 2016
Publisher: Science China Press, co-published with Springer
Source: Science China. Information sciences, 2016, v. 59, no. 5, 052104 How to cite?
Journal: Science China. Information sciences 
Abstract: Calling context encoding (CCE) uses some integers to represent the current context of any execution point, and is valuable in a wide range of applications. Existing studies already ensure accurate results of CCE, but they use stack to store the encoding when recursive calls happen. This may cost much for cyclic call graphs with deep recursive calls. This paper presents a novel approach (called RCCE) to address this problem. With a modified strategy for encoding, it requires less frequent access of the stack and gives more succinct representation of contexts on deep recursion. Experimental results show that compared to Precise Calling Context Encoding, RCCE is more practical and efficient on calling contexts with recursions.
URI: http://hdl.handle.net/10397/61292
ISSN: 1674-733X
EISSN: 1869-1919
DOI: 10.1007/s11432-015-5418-3
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

12
Last Week
1
Last month
Checked on Aug 14, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.