Sciweavers

417 search results - page 3 / 84
» Constructing Call Multigraphs Using Dependence Graphs
Sort
View
PLDI
1995
ACM
13 years 11 months ago
APT: A Data Structure for Optimal Control Dependence Computation
The control dependence relation is used extensively in restructuring compilers. This relation is usually represented using the control dependence graph; unfortunately, the size of...
Keshav Pingali, Gianfranco Bilardi
TSE
2010
151views more  TSE 2010»
13 years 5 months ago
The Probabilistic Program Dependence Graph and Its Application to Fault Diagnosis
This paper presents an innovative model of a program’s internal behavior over a set of test inputs, called the probabilistic program dependence graph (PPDG), that facilitates pr...
George K. Baah, Andy Podgurski, Mary Jean Harrold
ICSM
2009
IEEE
14 years 2 months ago
Incremental call graph reanalysis for AspectJ software
Program call graph representation can be used to support many tasks in compiler optimization, program comprehension, and software maintenance. During software evolution, the call ...
Yu Lin, Sai Zhang, Jianjun Zhao
ISSAC
2005
Springer
107views Mathematics» more  ISSAC 2005»
14 years 26 days ago
Symmetric and semisymmetric graphs construction using G-graphs
Symmetric and semisymmetric graphs are used in many scientific domains, especially parallel computation and interconnection networks. The industry and the research world make a h...
Alain Bretto, Luc Gillibert, Bernard Laget
ASE
2004
127views more  ASE 2004»
13 years 7 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