DocumentCode
2136058
Title
Extended whole program paths
Author
Tallam, Sriraman ; Gupta, Rajiv ; Zhang, Xiangyu
Author_Institution
Dept. of Comput. Sci., Arizona Univ., Tucson, AZ, USA
fYear
2005
fDate
17-21 Sept. 2005
Firstpage
17
Lastpage
26
Abstract
We describe the design, generation and compression of the extended whole program path (eWPP) representation that not only captures the control flow history of a program execution but also its data dependence history. This representation is motivated by the observation that typically a significant fraction of data dependence history can be recovered from the control flow trace. To capture the remainder of the data dependence history we introduce disambiguation checks in the program whose control flow signatures capture the results of the checks. The resulting extended control flow trace enables the recovery of otherwise unrecoverable data dependences. The code for the checks is designed to minimize the increase in the program execution time and the extended control flow trace size when compared to directly collecting control flow and dependence traces. Our experiments show that compressed eWPPs are only 4% of the size of combined compressed control flow and dependence traces and their collection requires 20% more runtime overhead than overhead required for directly collecting the control flow and dependence traces.
Keywords
program compilers; program control structures; control flow history; control flow signatures; data dependence history; extended whole program path; program execution time; Application software; Computer science; History; Intrusion detection; Optimizing compilers; Registers; Runtime; Size control; Software debugging; Software testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Architectures and Compilation Techniques, 2005. PACT 2005. 14th International Conference on
ISSN
1089-795X
Print_ISBN
0-7695-2429-X
Type
conf
DOI
10.1109/PACT.2005.22
Filename
1515577
Link To Document