Profiling selected paths with loops

作     者：LI BiXin WANG LuLu LEUNG Hareton 

作者机构：School of Computer Science and EngineeringSoutheast University Department of ComputingHong Kong Polytechnic University 

出 版 物：《Science China(Information Sciences)》 (中国科学:信息科学(英文版))

年 卷 期：2014年第57卷第7期

页      面：74-88页

核心收录：

学科分类：08[工学] 0835[工学-软件工程] 081202[工学-计算机软件与理论] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：supported by the Natural Science Foundation of Jiangsu Province (Grant No.BK20130633) the National Natural Science Foundation of China (Grant No.60973149) the Doctoral Fund of Ministry of Education of China (Grant No.20100092110022) 

主　　题：path profiling interesting paths dynamic analysis 

摘      要：Path profiling records the frequency of each path in an executed *** accomplish profiling,probes are instrumented in the program and executed as the program ***,the number of probes has a significant impact on the efficiency of a profiling *** profiling only the interesting paths,existing techniques try to improve the profiling efficiency by reducing the number of probes and optimize path encodings for efficient ***,they lack accuracy,waste time on running uninteresting paths,and can mainly deal with acyclic *** this article,a novel technique called Profiling Selected Paths(PSP)is introduced to profile selected paths,which enables custom selection for both acyclic and cyclic paths and increases the execution efficiency by early termination on uninteresting *** analysis and experimental evaluation indicate that PSP performs better than existing techniques.