The road not taken: Estimating path execution frequency statically

Proceedings - International Conference on Software Engineering

Volumn , Issue , 2009, Pages 144-154

  Buse, Raymond P L ^a   Weimer, Westley ^a  

^a UNIVERSITY OF VIRGINIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH PREDICTORS; BUG FINDING; FREQUENCY INFORMATION; HOT PATHS; PATH EXECUTION; QUALITATIVE ANALYSIS; RUNTIMES; SOURCE CODES; STATISTICAL MODELS; TEST INPUTS; TESTING FRAMEWORK;

SOFTWARE ENGINEERING;

PROGRAM PROCESSORS;

EID: 77949877530     PISSN: 02705257     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSE.2009.5070516     Document Type: Conference Paper

References (33)

1. G. Ammons, R. Bodík, and J. R. Larus. Mining specifications. In Principles of Programming Languages, pages 4-16, 2002.
2. G. Ammons and J. R. Larus. Improving data-flow analysis with path profiles. SIGPLAN Not., 33(5):72-84, 1998.
3. M. Arnold, S. J. Fink, V. Sarkar, and P. F. Sweeney. A comparative study of static and profile-based heuristics for inlining. In Workshop on Dynamic and Adaptive Compilation and Optimization, pages 52-64, 2000.
4. T. Baba, T. Masuho, T. Yokota, and K. Ootsu. Design of a two-level hot path detector for path-based loop optimizations. In Advances in Computer Science and Technology, pages 23-28, 2007.
5. T. Ball and J. R. Larus. Branch prediction for free. In Programming language design and implementation, pages 300-313, 1993.
6. T. Ball and J. R. Larus. Efficient path profiling. In International Symposium on Microarchitecture, pages 46-57, 1996.
7. T. Ball, P. Mataga, and M. Sagiv. Edge profiling versus path profiling: the showdown. In Principles of programming languages, pages 134-148, 1998.
8. P. Berube and J. Amaral. Aestimo: a feedback-directed optimization evaluation tool. In Performance Analysis of Systems and Software, pages 251-260, 2006.
9. M. Boyer, K. Skadron, and W. Weimer. Automated dynamic analysis of CUDA programs. In Workshop on Software Tools for MultiCore Systems, 2008.
10. B. Calder, D. Grunwald, M. Jones, D. Lindsay, J. Martin, M. Mozer, and B. Zorn. Evidence-based static branch prediction using machine learning. ACM Trans. Program. Lang. Syst., 19(1):188-222, 1997.
11. T. Y. Chen, F.-C. Kuo, and R. Merkel. On the statistical properties of the f-measure. In International Conference on Quality Software, pages 146-153, 2004.
12. E. Duesterwald and V. Bala. Software profiling for hot path prediction: less is more. SIGPLAN Not., 35(11):202-211, 2000.
13. E. J. Emond and D. W. Mason. A new rank correlation coefficient with application to the consensus ranking problem. In Journal of Multi-Criteria Decision Analysis, pages 17-28, Department of National Defence, Operational Research Division, Ottawa, Ontario, Canada, 2002. John Wiley Sons, Ltd.
14. D. R. Engler, D. Y. Chen, and A. Chou. Bugs as inconsistent behavior: A general approach to inferring errors in systems code. In Symposium on Operating Systems Principles, pages 57-72, 2001.
15. R. V.-R. et. al. Soot - a java optimization framework. In Proceedings of CASCON 1999, pages 125-135, 1999.
16. S. F. Goldsmith, A. S. Aiken, and D. S. Wilkerson. Measuring empirical computational complexity. In Foundations of software engineering, pages 395-404, 2007.
17. S. L. Graham, P. B. Kessler, and M. K. McKusick. gprof: a call graph execution profiler. SIGPLAN Not. (best of PLDI '82), 39(4):49-57, 2004.
18. R. Gupta, E. Mehofer, and Y. Zhang. Profile-guided compiler optimizations. In The Compiler Design Handbook, pages 143-174. 2002.
19. G. Holmes, A. Donkin, and I. Witten. Weka: A machine learning workbench. Australia and New Zealand Conference on Intelligent Information Systems, 1994.
20. T. Kremenek and D. R. Engler. Z-ranking: Using statistical analysis to counter the impact of static analysis approximations. In Static Analysis Symposium, pages 295-315, 2003.
21. D. Krishnamurthy, J. A. Rolia, and S. Majumdar. A synthetic workload generation technique for stress testing session-based systems. IEEE Trans. Softw. Eng., 32(11):868-882, 2006.
22. J. R. Larus. Whole program paths. In Programming language design and implementation, pages 259-269, 1999.
23. P. Mehra and B. Wah. Synthetic workload generation for load-balancing experiments. IEEE Parallel Distrib. Technol., 3(3):4-19, 1995.
24. M. C. Merten, A. R. Trick, C. N. George, J. C. Gyllenhaal, andW. Hwu. A hardware-driven profiling scheme for identifying program hot spots to support runtime optimization. In International Symposium on Computer architecture, pages 136-147, 1999.
25. T. Mitchell. Machine Learning. McGraw Hill, 1997.
26. A. Nanda and L. M. Ni. Benchmark workload generation and performance characterization of multiprocessors. In Conference on Supercomputing, pages 20-29. IEEE Computer Society Press, 1992.
27. T. Reps, T. Ball, M. Das, and J. Larus. The use of program profiling for software maintenance with applications to the year 2000 problem. SIGSOFT Softw. Eng. Notes, 22(6):432-449, 1997.
28. U. P. Schultz, J. L. Lawall, and C. Consel. Automatic program specialization for java. ACM Trans. Program. Lang. Syst., 25(4):452-499, 2003.
29. K. Sen. Concolic testing. In Automated Software Engineering, pages 571-572, 2007.
30. K. Sen and G. Agha. CUTE and jCUTE: Concolic unit testing and explicit path model-checking tools. In Computer Aided Verification, pages 419-423, 2006.
31. A. Srivastava and A. Eustace. Atom: a system for building customized program analysis tools. In Programming language design and implementation, pages 196-205, 1994.
32. W. Weimer and G. C. Necula. Mining temporal specifications for error detection. In Tools and Algorithms for the Construction and Analysis of Systems, pages 461-476, 2005.
33. W. Weimer and G. C. Necula. Exceptional situations and program reliability. ACM Trans. Program. Lang. Syst., 30(2):1-51, 2008.