Sciweavers

63 search results - page 1 / 13
» Reducing Indirect Function call Overhead in C Programs
Sort
View
POPL
1994
ACM
13 years 9 months ago
Reducing Indirect Function call Overhead in C++ Programs
Modern computer architectures increasingly depend on mechanisms that estimate future control flow decisions to increase performance. Mechanisms such as speculative execution and p...
Brad Calder, Dirk Grunwald
ASE
2004
127views more  ASE 2004»
13 years 4 months ago
Precise Call Graphs for C Programs with Function Pointers
Abstract. The use of pointers presents serious problems for software productivity tools for software understanding, restructuring, and testing. Pointers enable indirect memory acce...
Ana Milanova, Atanas Rountev, Barbara G. Ryder
SAC
1996
ACM
13 years 9 months ago
An enabling optimization for C++ virtual functions
Gaining the code re-use advantages of object oriented programming requires dynamic function binding, which allows a new subclass to override a function of a superclass. Dynamic bi...
Bradley M. Kuhn, David Binkley
SCAM
2002
IEEE
13 years 9 months ago
Precise Call Graph Construction in the Presence of Function Pointers
The use of pointers presents serious problems for software productivity tools for software understanding, restructuring, and testing. Pointers enable indirect memory accesses thro...
Ana Milanova, Atanas Rountev, Barbara G. Ryder
CC
2006
Springer
118views System Software» more  CC 2006»
13 years 8 months ago
Lightweight Lexical Closures for Legitimate Execution Stack Access
We propose a new language concept called "L-closures" for a running program to legitimately inspect/modify the contents of its execution stack. L-closures are lightweight...
Masahiro Yasugi, Tasuku Hiraishi, Taiichi Yuasa