53 search results - page 1 / 11 » An Empirical Study of Static Call Graph Extractors |
TOSEM
1998
13 years 4 months ago
1998
LCPC
1999
Springer
13 years 9 months ago
1999
Springer
Since the C language imposes little restriction on the use of function pointers, the task of call graph construction for a C program is far more di cult than what the algorithms d...
ASIAN
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. A software birthmark is a unique characteristic of a program that can be used as a software theft detection. In this paper we suggest and empirically evaluate a static bi...
OOPSLA
2000
Springer
13 years 8 months ago
2000
Springer
Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...
IWPC
2000
IEEE
13 years 9 months ago
2000
IEEE
Call graphs are commonly used as input for automatic clustering algorithms, the goal of which is to extract the high level structure of the program under study. Determining the ca...