Data-flow-based virtual function resolution

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1145, Issue , 1996, Pages 238-254

  Pande, Hemant D ^a   Ryder, Barbara G ^b  

^a TRDDC   (India)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; DATA TRANSFER; OBJECT ORIENTED PROGRAMMING; POLYNOMIAL APPROXIMATION; PROBLEM ORIENTED LANGUAGES; STATIC ANALYSIS;

COMPILE TIME; DATA FLOW; DYNAMIC BINDING; INHERITANCE HIERARCHIES; POLYNOMIAL TIME APPROXIMATION; PROGRAM FLOW; PROTOTYPE IMPLEMENTATIONS; VIRTUAL FUNCTIONS;

C++ (PROGRAMMING LANGUAGE);

EID: 84957617844     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61739-6_45     Document Type: Conference Paper

References (9)

1. [CG94] B. Calder and D. Grunwald. Reducing indirect function call overhead in C++ programs. In Conference Record of the Twenty-first Annual ACM Symposium on Principles of Programming Languages, pages 397-408, January 1994.
2. [CGZ95] B. Calder, D. Grunwald, and B. Zorn. Quantifying behavioural differences between C and C++ programs. Journal of Programming Languages, 2:313-351, 1995.
3. [LR91] W. Landi and B. G. Ryder. Pointer-induced aliasing: A problem classification. In Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, pages 93-103, January 1991.
4. [LR92] W. Landi and B. G. Ryder. A safe approximation algorithm for interprocedural pointer aliasing. In Proceedings of the SIGPLAN '92 Conference on Programming Language Design and Implementation, pages 235-248, June 1992.
5. [Pan96] H. Pande. Compile Time Analysis of C and C++ Systems. PhD thesis, Rutgers University, May 1996.
6. [PR94a] H. Pande and B. G. Ryder. Static type determination for C++. In Proceedings of the Sixth USENIX C++ Technical Conference, pages 85-97, April 1994.
7. [PR94b] H. D. Pande and B. G. Ryder. Static type determination and aliasing for C++. Laboratory for Computer Science Research Technical Report LCSR- TR-236, Rutgers University, December 1994.
8. [RHS95] T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In Conference Record of the Twenty-second Annual ACM Symposium on Principles of Programming Languages, pages 49-61, January 1995.
9. [SP81] M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. In S. Muchnick and N. Jones, editors, Program Flow Analysis: Theory and Applications, pages 189-234. Prentice Hall, 1981.