[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.5555/882455.874990guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Path Matching in Compressed Control Flow Traces

Published: 02 April 2002 Publication History

Abstract

Due to its large size, a whole program path (WPP) is stored in compressed form generated using SEQUITUR. The occurrence of an intraprocedural path in the WPP cannot be carried out using existing algorithms due to the path interruption and path context problems. We present an algorithm that addresses the above problems. The complexity of the algorithm is analyzed and experimental data is presented to demonstrate that our algorithm is efficient in practice.

References

[1]
A. Amir, G. Benson, and M. Farach, "Let Sleeping Files Lie: Pattern Matching in Z-compressed Files," Journal of Computer and System Sciences, Vol. 52, pages 299-307, 1996.
[2]
T. Kida, Y. Shibata, M. Takeda, A. Shinohara, and S. Arikawa, "A Unifying Framework for Compressed Pattern Matching," 6th International Symposium on String Processing and Information Retrieval, pages 89-96. IEEE Computer Society, 1999.
[3]
J. Larus, "Whole Program Paths," ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 259-269, Atlanta, GA, May 1999.
[4]
C. Nevill-Manning and I. Witten, "Identifying Hierarchical Structure in Sequences: A Linear-time Algorithm," Journal of Artificial Intelligence Research, Vol. 7, pages 67-82, 1997.
[5]
S. Mitarai, M. Rirao, T. Matsumoto, A. Shinohara, M. Takeda, and S. Arikawa, "Compressed Pattern Matching for SEQUITUR," Data Compression Conference (DCC), 2001.
[6]
Trimaran Compiler Infrastructure. http://www.trimaran.org/.
[7]
Y. Zhang and R. Gupta, "Timestamped Whole Program Path Representation and its Applications", ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 180-190, Snowbird, UT, June 2001.
[8]
http://www.spec.org/osg/cpu95/.
[9]
G. Navarro, T. Kida, M. Takeda, A. Shinohara, and S. Arikawa, "Faster Approximate String Matching Over Compressed Text," Data Compression Conference, pages 459-467, 2001.
[10]
A. Amir and G. Benson, "Efficient Two-dimensional Compressed Matching," Data Compression Conference, pages 279-288, 1992.

Cited By

View all
  • (2002)Dataflow Frequency Analysis Based on Whole Program PathsProceedings of the 2002 International Conference on Parallel Architectures and Compilation Techniques10.5555/645989.674305(95-103)Online publication date: 22-Sep-2002

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Guide Proceedings
DCC '02: Proceedings of the Data Compression Conference
April 2002

Publisher

IEEE Computer Society

United States

Publication History

Published: 02 April 2002

Author Tags

  1. SEQUITUR
  2. compressed control flow traces
  3. pattern matching

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 26 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2002)Dataflow Frequency Analysis Based on Whole Program PathsProceedings of the 2002 International Conference on Parallel Architectures and Compilation Techniques10.5555/645989.674305(95-103)Online publication date: 22-Sep-2002

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media