1497 search results - page 122 / 300 » Extended static checking |
IWDC
2001
Springer
14 years 2 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...
CONCUR
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. The technique of partial order reduction (POR) for probabilistic model checking prunes the state space of the model so that a maximizing scheduler and a minimizing one pe...
IUI
2003
ACM
14 years 3 months ago
2003
ACM
Interactive tools to help users author plans or processes are essential in a variety of domains. KANAL helps users author sound plans by simulating them, checking for a variety of...
ACSAC
2002
IEEE
14 years 3 months ago
2002
IEEE
The individual vulnerabilities of hosts on a network can be combined by an attacker to gain access that would not be possible if the hosts were not interconnected. Currently avail...
CSR
2008
Springer
14 years 7 hour ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...