Sciweavers

6527 search results - page 244 / 1306
» On Typing Information Flow
Sort
View
INFOCOM
2012
IEEE
13 years 9 months ago
Cuckoo sampling: Robust collection of flow aggregates under a fixed memory budget
—Collecting per-flow aggregates in high-speed links is challenging and usually requires traffic sampling to handle peak rates and extreme traffic mixes. Static selection of sa...
Josep Sanjuàs-Cuxart, Pere Barlet-Ros, Nick...
195
Voted
SP
2010
IEEE
190views Security Privacy» more  SP 2010»
15 years 4 months ago
Noninterference through Secure Multi-execution
A program is defined to be noninterferent if its outputs cannot be influenced by inputs at a higher security level than their own. Various researchers have demonstrated how this pr...
Dominique Devriese, Frank Piessens
ESCIENCE
2007
IEEE
15 years 10 months ago
Formal Modeling and Analysis of Scientific Workflows Using Hierarchical State Machines
Scientific workflows have recently emerged as a new paradigm for representing and managing complex distributed scientific computations and data analysis, and have enabled and acce...
Ping Yang, Zijiang Yang, Shiyong Lu
INFORMS
2008
241views more  INFORMS 2008»
15 years 6 months ago
Solving the Capacitated Local Access Network Design Problem
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
F. Sibel Salman, R. Ravi, John N. Hooker
POPL
1998
ACM
15 years 11 months ago
The SLam Calculus: Programming with Secrecy and Integrity
The SLam calculus is a typed -calculus that maintains security information as well as type information. The type system propagates security information for each object in four for...
Nevin Heintze, Jon G. Riecke