Sciweavers

256 search results - page 3 / 52
» Application-Only Call Graph Construction
Sort
View
TAICPART
2010
IEEE
133views Education» more  TAICPART 2010»
13 years 8 months ago
Localizing Defects in Multithreaded Programs by Mining Dynamic Call Graphs
Abstract. Writing multithreaded software for multicore computers confronts many developers with the difficulty of finding parallel programming errors. In the past, most parallel d...
Frank Eichinger, Victor Pankratius, Philipp W. L. ...
CSMR
1999
IEEE
14 years 2 months ago
Impact of Function Pointers on the Call Graph
Maintenance activities are made more difficult when pointers are heavily used in source code: the programmer needs to build a mental model of memory locations and of the way they ...
Giuliano Antoniol, F. Calzolari, Paolo Tonella
CIKM
2006
Springer
14 years 1 months ago
On the structural properties of massive telecom call graphs: findings and implications
With ever growing competition in telecommunications markets, operators have to increasingly rely on business intelligence to offer the right incentives to their customers. Toward ...
Amit Anil Nanavati, Siva Gurumurthy, Gautam Das, D...
ISSAC
2005
Springer
107views Mathematics» more  ISSAC 2005»
14 years 3 months 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
TCC
2012
Springer
218views Cryptology» more  TCC 2012»
12 years 5 months ago
Iterative Constructions and Private Data Release
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
Anupam Gupta, Aaron Roth, Jonathan Ullman