Sciweavers

417 search results - page 4 / 84
» Constructing Call Multigraphs Using Dependence Graphs
Sort
View
CSMR
1999
IEEE
13 years 11 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
JOT
2010
173views more  JOT 2010»
13 years 5 months ago
A Dependence Representation for Coverage Testing of Object-Oriented Programs
Abstract We propose a dependence-based representation for object-oriented programs, named Call-based Object-Oriented System Dependence Graph (COSDG). Apart from structural features...
E. S. F. Najumudheen, Rajib Mall, Debasis Samanta
CIKM
2006
Springer
13 years 11 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...
STOC
2005
ACM
147views Algorithms» more  STOC 2005»
14 years 7 months ago
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sud...
COCO
2007
Springer
89views Algorithms» more  COCO 2007»
14 years 1 months ago
Testing Properties of Constraint-Graphs
We study a model of graph related formulae that we call the Constraint-Graph model. A constraintgraph is a labeled multi-graph (a graph where loops and parallel edges are allowed)...
Shirley Halevy, Oded Lachish, Ilan Newman, Dekel T...