article

Free access

Improving data-flow analysis with path profiles

Authors:

James R. LarusAuthors Info & Claims

ACM SIGPLAN Notices, Volume 33, Issue 5

Pages 72 - 84

https://doi.org/10.1145/277652.277665

Published: 01 May 1998 Publication History

Abstract

Data-flow analysis computes its solutions over the paths in a control-flow graph. These paths---whether feasible or infeasible, heavily or rarely executed---contribute equally to a solution. However, programs execute only a small fraction of their potential paths and, moreover, programs' execution time and cost is concentrated in a far smaller subset of hot paths.This paper describes a new approach to analyzing and optimizing programs, which improves the precision of data flow analysis along hot paths. Our technique identifies and duplicates hot paths, creating a hot path graph in which these paths are isolated. After flow analysis, the graph is reduced to eliminate unnecessary duplicates of unprofitable paths. In experiments on SPEC95 benchmarks, path qualification identified 2--112 times more non-local constants (weighted dynamically) than the Wegman-Zadek conditional constant algorithm, which translated into 1--7% more dynamic instructions with constant results.

References

[1]

Glenn Ammons, Thomas Ball, and James R. Laxus. Exploiting hardware performance counters with flow and context sensitive profiling. In Proceedings of the SIGPLAN '97 Conference on Programraing Language Design and Implementation, June 1997.

Digital Library

[2]

Alfred V. Aho. Algorithms for finding patterns in strings. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A, chapter 5, pages 255-300. MIT Press, 1994.

Digital Library

[3]

Rastislav Bod/k and Sadun Anlk. Path-sensitive value-flow analysis. In Proceedings of the SIGPLAN '98 Symposium on Principles of Programming Languages (POPL), January 1998.

Digital Library

[4]

Rastislav Bodik, Rajiv Gupta, and Mary Lou Sofia. Interprocedural conditional branch elimination. In Proceedings of the SiGPLAN '97 Conference on Programming Language Design and Implementation (PLDI), pages 146-158, June 1997.

Digital Library

[5]

Rastislav Bodlk, Rajiv Gupta, and Mary Lou Sofia. Refining data flow information using infeasible paths. In Fifth A CM SIGSOFT Symposium on Foundations of Software Engineering and Sixth European Software Engineering Conference, September 1997.

Digital Library

[6]

Rastislav Bod{k, Rajiv Gupta, and Mary Lou Sofia. Complete removal of redundant computations. In Proceedings of the SIGPLAN '98 Conference on Programming Language Design and Implementation (PLDI), June 1998. To appear.

Digital Library

[7]

T. Ball and J. R. Larus. Efficient path profiling. In Proceedings of MICRO 96, pages 46-57, December 1996.

Digital Library

[8]

Joseph A. Fisher. Trace scheduIing: A technique for global mlcrocode compaction. IEEE Transactions on Computers, C-30(7):478-490, July 1981.

Digital Library

[9]

David Gries. Describing an algorithm by hopcroft. Acts Informatica, 2:97-109, 1973.

Digital Library

[10]

Allen Goldberg, T. C. Wang, and David Zimmerman. Applications of feasible path analysis to program testing. In International Symposium on Software Testing and Analysis. ACM SIGSOFT, August 1994.

Digital Library

[11]

L. Howard Holley and Barry K. Rosen. Qualified data flow probIems. IEEE 7~ansactions on Software Engineering, SE-7(1):60-78, January 1981.

[12]

Frank Mueller and David B. Whalley. Avoiding conditional branches by code replication. In Proceedings of the SIGPLAN '95 Conference on Programming Language Design and Implementation (PLDI), pages 56-66, June 1995.

Digital Library

[13]

Wen met W. Hwu, Scott A. Mahlke, William Y. Chen, Pohua P. Chang, Nancy J. Warter, Roger A. Brlngmann, Roland G. Ouellette, Richard E. Hank, Tokuzo Kiyohara, Grant E. Hash, John G. Holm, and Daniel M. Lavery. The superblock: An effective technique for VLIW and superscalar compilation. The Journal of Supercomputing, 7(1-2):229- 248, May 1993.

Digital Library

[14]

G. RamaJingam. Data flow frequency analysis. In Proceedings of the SIGPLAN '96 Conference on Programming Language Design and Implementation, pages 267-277, May 1996.

Digital Library

[15]

Robert P. Wilson, Robert S. French, Christopher S. Wilson, Saman P. Amarasinghe, Jennifer M. Anderson, Steve W. K. Tjiang, Shih-Wei Liao, Chau- Wen Tseng, Mary W. Hall, Monica S. Lain, and John L. Hennessy. An overview of the SUIF compiler system. Published on the World Wide Web at http://sulf, stanford.edu/suif/suifl/suif-overview/sulf, html.

[16]

Mark N. Wegman and F. Kenneth Zadeck. Constant propagation with conditional branches. A CM Transactions on Programming Languages and Systems, 13(2):181-210, April 1991.

Digital Library

Cited By

Pathade KKhedker U(2023)Computing maximum fixed point solutions over feasible paths in data flow analysesScience of Computer Programming10.1016/j.scico.2023.102944228(102944)Online publication date: Jun-2023
https://doi.org/10.1016/j.scico.2023.102944
Fang YWang CSun ZCheng H(2021)Jyane: Detecting Reentrancy vulnerabilities based on path profiling method2021 IEEE 27th International Conference on Parallel and Distributed Systems (ICPADS)10.1109/ICPADS53394.2021.00040(274-282)Online publication date: Dec-2021
https://doi.org/10.1109/ICPADS53394.2021.00040
Zhang JTian CDuan Z(2021)An efficient approach for taint analysis of android applicationsComputers & Security10.1016/j.cose.2020.102161104(102161)Online publication date: May-2021
https://doi.org/10.1016/j.cose.2020.102161
Show More Cited By

Index Terms

Improving data-flow analysis with path profiles
1. Software and its engineering
  1. Software notations and tools
    1. Compilers
2. Theory of computation
  1. Randomness, geometry and discrete structures
  2. Semantics and reasoning
    1. Program constructs
      1. Control primitives

Recommendations

Improving data-flow analysis with path profiles
PLDI '98: Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation

Data-flow analysis computes its solutions over the paths in a control-flow graph. These paths---whether feasible or infeasible, heavily or rarely executed---contribute equally to a solution. However, programs execute only a small fraction of their ...
Improving data-flow analysis with path profiles
20 Years of the ACM SIGPLAN Conference on Programming Language Design and Implementation 1979-1999: A Selection

Data-flow analysis computes its solutions over the paths in a control-flow graph. These paths---whether feasible or infeasible, heavily or rarely executed---contribute equally to a solution. However, programs execute only a small fraction of their ...
Comprehensive path-sensitive data-flow analysis
CGO '08: Proceedings of the 6th annual IEEE/ACM international symposium on Code generation and optimization

Data-flow analysis is an integral part of any aggressive optimizing compiler. We propose a framework for improving the precision of data-flow analysis in the presence of complex control-flow. We initially perform data-flow analysis to determine those ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGPLAN Notices

ACM SIGPLAN Notices Volume 33, Issue 5

May 1998

358 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/277652

Chairmen:
Jack W. Davidson
Univ. of Virginia
,
Keith D. Cooper
Rice Univ., Houston, TX
,
Editor:
A. Michael Berman
Rowan Univ., Glassboro, NJ

Issue’s Table of Contents

PLDI '98: Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
May 1998
357 pages
ISBN:0897919874
DOI:10.1145/277650
Chairmen:
Jack W. Davidson
Univ. of Virginia
,
Keith D. Cooper
Rice Univ. Houston, TX
,
Editor:
A. Michael Berman
Rowan Univ. Glassboro, NJ

Copyright © 1998 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1998

Published in SIGPLAN Volume 33, Issue 5

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

141
Total Citations
View Citations
1,290
Total Downloads

Downloads (Last 12 months)189
Downloads (Last 6 weeks)38

Reflects downloads up to 18 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Pathade KKhedker U(2023)Computing maximum fixed point solutions over feasible paths in data flow analysesScience of Computer Programming10.1016/j.scico.2023.102944228(102944)Online publication date: Jun-2023
https://doi.org/10.1016/j.scico.2023.102944
Fang YWang CSun ZCheng H(2021)Jyane: Detecting Reentrancy vulnerabilities based on path profiling method2021 IEEE 27th International Conference on Parallel and Distributed Systems (ICPADS)10.1109/ICPADS53394.2021.00040(274-282)Online publication date: Dec-2021
https://doi.org/10.1109/ICPADS53394.2021.00040
Zhang JTian CDuan Z(2021)An efficient approach for taint analysis of android applicationsComputers & Security10.1016/j.cose.2020.102161104(102161)Online publication date: May-2021
https://doi.org/10.1016/j.cose.2020.102161
Byma SLarus J(2018)Detailed heap profilingACM SIGPLAN Notices10.1145/3299706.321056453:5(1-13)Online publication date: 18-Jun-2018
https://dl.acm.org/doi/10.1145/3299706.3210564
Byma SLarus JPayer HSartor J(2018)Detailed heap profilingProceedings of the 2018 ACM SIGPLAN International Symposium on Memory Management10.1145/3210563.3210564(1-13)Online publication date: 18-Jun-2018
https://dl.acm.org/doi/10.1145/3210563.3210564
Ahmed NGhosh SHassan RGalib SAzad ASyrus M(2017)A gradient sensing middleware to handle flash floodComputers and Electrical Engineering10.1016/j.compeleceng.2017.08.00662:C(44-52)Online publication date: 1-Aug-2017
https://dl.acm.org/doi/10.1016/j.compeleceng.2017.08.006
Ahmed NAzad AKhan MHabib AGhosh SShahid S(2016)ShonaBondhu: a cloud based system to handle flash flood2016 International Conference on Networking Systems and Security (NSysS)10.1109/NSysS.2016.7400688(1-6)Online publication date: Jan-2016
https://doi.org/10.1109/NSysS.2016.7400688
Ahmed N(2010)Reliable framework for unreliable RFID devices2010 8th IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops)10.1109/PERCOMW.2010.5470571(871-872)Online publication date: Mar-2010
https://doi.org/10.1109/PERCOMW.2010.5470571
Ahmed NRamachandran U(2010)A path based reliable middleware framework for RFID devices2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW)10.1109/IPDPSW.2010.5470797(1-4)Online publication date: Apr-2010
https://doi.org/10.1109/IPDPSW.2010.5470797
Ootsu KOgawa HYokota TBaba T(2009)Program Execution Path-Based Speculative Thread PartitioningTransactions of the Institute of Systems, Control and Information Engineers10.5687/iscie.22.20922:6(209-219)Online publication date: 2009
https://doi.org/10.5687/iscie.22.209
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents