Sciweavers

1795 search results - page 104 / 359
» Security Models and Information Flow
Sort
View
159
Voted
EJC
2011
14 years 10 months ago
Distributive lattices, polyhedra, and generalized flows
A D-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive latti...
Stefan Felsner, Kolja B. Knauer
147
Voted
SP
2010
IEEE
190views Security Privacy» more  SP 2010»
15 years 1 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
143
Voted
ICFEM
2005
Springer
15 years 9 months ago
A Compositional Framework for Service Interaction Patterns and Interaction Flows
We provide precise high-level models for eight fundamental service interaction patterns, together with schemes for their composition into complex service-based business process int...
Alistair P. Barros, Egon Börger
119
Voted
ICDCSW
2002
IEEE
15 years 8 months ago
Stability of Autonomous Decentralized Flow Control Schemes in High-Speed Networks
This paper focuses on flow control in high-speed networks. Each node in the networks handles its local traffic flow only on the basis of the information it knows, but it is pre...
Masaki Aida, Chisa Takano
93
Voted
FORTE
2007
15 years 5 months ago
A Simple Positive Flows Computation Algorithm for a Large Subclass of Colored Nets
Positive flows provide very useful informations that can be used to perform efficient analysis of a model. Although algorithms computing (a generative family of) positive flows i...
Sami Evangelista, Christophe Pajault, Jean-Fran&cc...