90 search results - page 2 / 18 » Exploiting Dynamic Independence in a Static Conditioning Gra... |
SCAM
2003
IEEE
13 years 11 months ago
2003
IEEE
Many static analyses aim at assigning to each control point of a program an invariant property that characterizes any state of a trace corresponding to this point. The choice of t...
CONEXT
2009
ACM
13 years 7 months ago
2009
ACM
Network traffic can be represented by a Traffic Dispersion Graph (TDG) that contains an edge between two nodes that send a particular type of traffic (e.g., DNS) to one another. T...
IWDC
2001
Springer
13 years 10 months ago
2001
Springer
— In this paper we show that significant simplicity can be exploited for pricing-based control of large networks. We first consider a general loss network with Poisson arrivals...
ISCA
1999
IEEE
13 years 10 months ago
1999
IEEE
Several ILP limit studies indicate the presence of considerable ILP across dynamically far-apart instructions in program execution. This paper proposes a hardware mechanism, dynam...
SOFTVIS
2005
ACM
13 years 12 months ago
2005
ACM
In this paper we present an approach to modeling and visualizing the dynamic interactions among objects in a C++ application. We exploit UML diagrams to expressively visualize bot...