On the use of data flow analysis in static profiling

Proceedings - 8th IEEE International Working Conference on Source Code Analysis and Manipulation, SCAM 2008

Volumn , Issue , 2008, Pages 79-88

  Boogerd, Cathal ^a   Moonen, Leon ^b  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b SIMULA RESEARCH LABORATORY   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); HEURISTIC ALGORITHMS; PROGRAM COMPILERS;

ANALYSIS TECHNIQUES; BRANCH PREDICTIONS; COMPILER OPTIMIZATIONS; CONTROL FLOW GRAPHS; COST/BENEFIT RATIOS; DATA FLOWS; SIMPLE ALGORITHMS; SOURCE CODE ANALYSES;

DATA FLOW ANALYSIS;

EID: 56349092846     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SCAM.2008.18     Document Type: Conference Paper

References (20)

1. T. Ball and J. R. Larus. Branch Prediction For Free. In ACM Conf. on Programming Language Design and Implementation (PLDI), pages 300-313, June 1993.
2. D. Binkley. Interprocedural Constant Propagation using Dependence Graphs and a Data-Flow Model. In 5th Int. Conf. on Compiler Construction (CC), volume 786 of LNCS, pages 374-388. Springer, 1994.
3. W. Blume and R. Eigenmann. Demand-Driven, Symbolic Range Propagation. In 8th Int. Ws. on Languages and Compilers for Parallel Computing, (LCPC'95), volume 1033 of LNCS, pages 141-160. Springer, 1995.
4. C. Boogerd and L. Moonen. Prioritizing Software Inspection Results using Static Profiling. In Proc. Sixth IEEE Int. Ws. on Source Code Analysis and Manipulation (SCAM), pages 149-158. IEEE CS, September 2006.
5. B.L. Deitrich, B-C. Cheng, and W.W. Hwu. Improving static branch prediction in a compiler. In 18th Ann. Int. Conf. on Parallel Architectures and Compilation Techniques (PACT), pages 214-221. IEEE CS, 1998.
6. T. Fahringer and B. Scholz. A Unified Symbolic Evaluation Framework for Parallelizing Compilers. IEEE Trans. Parallel Distrib. Syst., 11(11): 1105-1125, 2000.
7. J.A. Fisher and S.M. Freudenberger. Predicting conditional branch directions from previous runs of a program. In 5th Int. Conf. on Architectural Support for Programming Languages and Operating Systems, pages 85-95, 1992.
8. Shafer G. A Mathematical Theory of Evidence. Princeton Univ. Press, 1976.
9. S. Horwitz, T.W. Reps, and D. Binkley. Interprocedural slicing using dependence graphs. ACM Trans. Program. Lang. Syst., 12(1):26-60, 1990.
10. D. Jackson and E. J. Rollins. A new model of program dependences for reverse engineering. In Proc. 2nd ACM SIGSOFT Symp. on Foundations of Software Engineering, pages 2-10. ACM Press, 1994.
11. J. Knoop and O. Rüthing. Constant propagation on the value graph: Simple constants and beyond. In 9th Int. Conf. on Compiler Construction (CC), volume 1781 of LNCS, pages 94-109. Springer, 2000.
12. J. R. C. Patterson. Accurate static branch prediction by value range propagation. In ACM Conf. on Programming Language Design and Implementation (PLDI), pages 67-78, 1995.
13. T. W. Reps and G. Rosay. Precise interprocedural chopping. In Proc. 3nd ACM SIGSOFT Symp. on Foundations of Software Engineering, pages 41-52. ACM Press, 1995.
14. S. Sagiv, T. W. Reps, and S. Horwitz. Precise interprocedural dataflow analysis with applications to constant propagation. In 6th Int. Conf. on Theory and Practice of Software Development (TAPSOFT'95), volume 915 of LNCS, pages 651-665. Springer, 1995.
15. M. Shapiro and S. Horwitz. Fast and Accurate Flow-Insensitive Points-To Analysis. In 24th ACM Symp. on Principles of Programming Languages (POPL'97), pages 1-14, January 1997.
16. C. Verbrugge, P. Co, and L.J. Hendren. Generalized constant propagation: A study in C. In 6th Int. Conf. on Compiler Construction (CC), volume 1060 of LNCS, pages 74-90. Springer, 1996.
17. J.M. Voas and K.W. Miller. Software Testability: The New Verification. IEEE Softw., pages 17-28, 1995.
18. T.A. Wagner, V. Maverick, S.L. Graham, and M.A. Harrison. Accurate static estimators for program optimization. In ACM Conf. on Programming Language Design and Implementation (PLDI), pages 85-96, 1994.
19. D.W. Wall. Predicting program behavior using real or estimated profiles. In ACM Conf. on Programming Language Design and Implementation (PLDI), pages 59-70, June 1991.
20. Y. Wu and J.R. Larus. Static branch frequency and program profile analysis. In 27th Ann. Int. Symp. on Microarchitecture, pages 1-11. ACM/IEEE, 1994.