Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/26434
Title: Profiling all paths : a new profiling technique for both cyclic and acyclic paths
Authors: Li, B
Wang, L
Leung, H 
Liu, F
Keywords: Breakpoint
Cyclic paths
Dynamic analysis
Path backwalk
Path profiling
Probe instrumentation
Issue Date: 2012
Publisher: Elsevier
Source: Journal of systems and software, 2012, v. 85, no. 7, p. 1558-1576 How to cite?
Journal: Journal of systems and software 
Abstract: As an important technique in dynamic program analysis, path profiling collects the execution frequency of different paths, and has been widely used in a variety of areas. However, existing intra-procedural profiling techniques cannot effectively deal with loops, i.e.; they are limited in either working with acyclic paths, or with a small number of loop iteration. This paper presents a new profiling technique called PAP (Profiling All Paths), which can profile all finite-length paths within a procedure. PAP consists of two basic phases, the probe instrumentation phase which assigns a unique pathid to each path, and the backwalk phase which uses the pathids to determine the corresponding executed paths. Furthermore, breakpoints are introduced to store the probe value which may overflow during long executions, and the number of probes is reduced based on the integration of PAP with an existing profiling technique. From our case study and experiments, PAP is found to be effective and efficient in profiling both cyclic and acyclic paths.
URI: http://hdl.handle.net/10397/26434
ISSN: 0164-1212
DOI: 10.1016/j.jss.2012.01.046
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

8
Last Week
0
Last month
0
Citations as of Nov 11, 2017

WEB OF SCIENCETM
Citations

4
Last Week
0
Last month
0
Citations as of Nov 17, 2017

Page view(s)

42
Last Week
0
Last month
Checked on Nov 13, 2017

Google ScholarTM

Check

Altmetric



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