Arithmetic program paths

ESEC/FSE'05 - Proceedings of the Joint 10th European Software Engineering Conference (ESEC) and 13th ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE-13)

Volumn , Issue , 2005, Pages 90-98

  Renieris, Manos ^a   Ramaprasad, Shashank ^a   Reiss, Steven P ^a  

^a Brown Univerity   (United States)

Author keywords

Arithmetic Coding; Bit tracing; Branch Prediction

Indexed keywords

ENCODING (SYMBOLS); MATHEMATICAL MODELS; PROBABILITY DISTRIBUTIONS; PROGRAM PROCESSORS; SHAPE MEMORY EFFECT; SOFTWARE ENGINEERING;

ARITHMETIC CODING; BIT-TRACING; BRANCH PREDICTION; COMPRESSION RATE;

MATHEMATICAL TECHNIQUES;

EID: 32344449134     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1095430.1081721     Document Type: Conference Paper

References (33)

1. Hiralal Agrawal and Joseph R. Horgan. Dynamic program slicing. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 1990.
2. Glenn Ammons, Rastislav Bodik, and James Larus. Mining specifications. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2002.
3. Thomas Ball and James R. Larus. Efficient path profiling. In Proceedings of the 29th Annual International Symposium on Microarchitecture, pages 46-57, 1996.
4. M. Burtscher. Vpc3: A fast and effective trace-compression algorithm. In Joint International Conference on Measurement and Modeling of Computer Systems, pages 167-176, June 2004.
5. M. Burtscher and M. Jeeradit. Compressing extended program traces using value predictors. International Conference on Parallel Architectures and Compilation Techniques, pages 159-169, 2003.
6. John G. Cleary and Ian H. Witten. A comparison of enumerative and adaptive codes. IEEE Transactions on Information Theory, 30(2):306-315, March 1984.
7. Evelyn Duesterwald and Vasanth Bala. Software profiling for hot path prediction: Less is more. In Proceedings of the International Conference on Architectural Support for Programming Languages and Operating Systems, 2000.
8. Rajiv Gupta, Mary Lou Soffa, and John Howard. Hybrid slicing: Integrating dynamic information with static analysis. In Proceedings of the ACM SIGSOFT International Symposium on the Foundations of Software Engineering, October 1995.
9. Pascal Van Hentenryck. Incremental Constraint Satisfaction in Logic Programming. In Seventh International Conference on Logic Programming, Jerusalem, Israel, June 1990.
10. D.A. Huffman. A method for the construction of minimum redundancy codes. In Proceedings of IRE, volume 40, pages 1098 - 1101, 1952.
11. Rastislav Bodík, Rajiv Gupta, and Mary Lou Soffa. Interprocedural conditional branch elimination. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 1997.
12. G. G. Langdon. Introduction to arithmetic coding. IBM Journal of Research and Development, 1984.
13. J. Larus. Abstract execution: a technique for efficiently tracing programs. Software - Practice& Experience, 20, 1990.
14. James R. Larus. Whole program paths. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 259-269, 1999.
15. Zhijian Lu, John Lach, Mircea R. Stan, and Kevin Skadron. Alloyed branch history: Combining global and local branch history for robust performance. International Journal of Parallel Programming, 31(2):137-177, April 2003.
16. Scott McFarling. Combining branch predictors. Technical Note TN-36, Digital Equipment Corporation Western Research Laboratory (WRL), June 1993.
17. David Melski and Thomas Reps. Interprocedural path profiling. Technical Report CS-TR-1998-1382, University of Wisconsin, Madison, September 1998.
18. A. Moffat, R. Neal, and I.H. Witten. Arithmetic coding revisited. In IEEE Data Compression Conference, pages 202-211, 1995.
19. Ravi Nair. Branch behavior on the IBM RS/6000. Technical Report 17859, IBM Thomas J. Watson Research Center, 1992.
20. George C. Necula, Scott McPeak, S.P. Rahul, and Westley Weimer. CIL: Intermediate language and tools for analysis and transformation of C programs. In International Conference on Compiler Construction, April 2002.
21. Craig G. Nevill-Manning and Ian H. Witten. Linear-time, incremental hierarchy inference for compression. In DCC: Data Compression Conference. IEEE Computer Society TCC, 1997.
22. R. Pasco. Source Coding Algorithms for fast data compression. PhD thesis, Dept. of EE, Stanford University, Stanford, CA, 1976.
23. Andrew Pleszkun. Techniques for compressing program address traces. XXVII Annual IEEE/ACM Symposium on Microarchitecture, pages 32-40, 1994.
24. Steven P. Reiss. Trace-based debugging. In Peter Fritzon, editor, Automated and Algorithmic Debugging, First International Workshop, AADEBUG'93, volume 749 of Lecture Notes in Computer Science, pages 305-314. Springer, 3-5 May 1993.
25. Steven P. Reiss and Manos Renieris. Encoding program executions. In Proceedings of the 23rd International Conference on Software Engineering, pages 221-230, 2003.
26. J.J. Risannen. Arithmetic codings as number representations. In Acta Polytech. Scand. Math., 1979.
27. Claude E. Shannon. A mathematical theory of communication. Technical report, Bell Systems Technical Journal, 1948.
28. John Paul Shen and Mikko H. Lipasti. Modern Processor Design: Fundamentals of Superscalar Processors. McGraw-Hill, 2005.
29. James E. Smith. A study of branch prediction strategies. In ISCA '81: Proceedings of the 8th annual symposium on Computer Architecture, pages 135-148. IEEE Computer Society Press, 1981.
30. Bjarne Steensgaard. Points-to analysis in almost linear time. In Symposium on Principles of Programming Languages, pages 32-41, 1996.
31. I.H. Witten, R. Neal, and J. Cleary. Arithmetic coding for data compression. Comm. of the ACM, pages 520-540, 1987.
32. Tse-Yu Yeh and Yale N. Patt. A comparison of dynamic branch predictors that use two levels of branch history. In ISCA, pages 257-266, 1993.
33. Y. Zhang and R. Gupta. Timestamped whole program paths. Conference on Programming Language Design and Implementation, 2001.