By Topic

Performance comparison of path matching algorithms over compressed control flow traces

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lin Yongjing ; Dept. of Comput. Sci., Texas Univ., Richardson, TX, USA ; Youtao Zhang

A control flow trace captures the complete sequence of dynamically executed basic blocks and function calls. It is usually stored in compressed form due to its large size. Matching an intraprocedural path in a control flow trace faces path interruption and path context problems and therefore requires the extension of traditional pattern matching algorithms. In this paper we evaluate different path matching schemes including those matching in the compressed data directly and those matching after the decompression. We design simple indices for the compressed data and show that they can greatly improve the performance. Our experimental results show that these schemes are useful and can be adapted to environments with different hardware settings and path matching requests.

Published in:

Data Compression Conference, 2005. Proceedings. DCC 2005

Date of Conference:

29-31 March 2005