Efficient Path Profiling Thomas Ball James R. Larus. 2005. Dec. 6 Chihun Kim. Contents. Introduction Limitation of edge profiling Algorithm of efficient path profiling Basic idea Compactly representing paths with unique integer Finding instrumentation point Placing instrumentations
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
2005. Dec. 6
All path strings prefixed with KB are numbered with (0 ~ X-1)
All path strings prefixed with KA are numbered with (X ~ X+Y-1)
Number of path from K to exit is (X+Y)
X = Number of path from B to exit