Sciweavers

264 search results - page 6 / 53
» Decomposing Algebraic Varieties
Sort
View
IPPS
2007
IEEE
14 years 3 months ago
Decomposing Partial Order Execution Graphs to Improve Message Race Detection
In message-passing parallel applications, messages are not delivered in a strict order. In most applications, the computation results and the set of messages produced during the e...
Basile Schaeli, Sebastian Gerlach, Roger D. Hersch
CSFW
1995
IEEE
14 years 7 days ago
Composing and decomposing systems under security properties
We investigate the formal relationship between separability of processes and the types of non-interference properties they enjoy. Though intuitively appealing, separability – th...
A. W. Roscoe, L. Wulf
DAM
2010
137views more  DAM 2010»
13 years 8 months ago
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...
FMCO
2005
Springer
14 years 2 months ago
Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation
We present a method for decomposing modal formulas for processes with the internal action τ. To decide whether a process algebra term satisfies a modal formula, one can check whe...
Wan Fokkink, Rob J. van Glabbeek, Paulien de Wind
ANTS
2004
Springer
95views Algorithms» more  ANTS 2004»
14 years 13 days ago
Using Primitive Subgroups to Do More with Fewer Bits
Abstract. This paper gives a survey of some ways to improve the efficiency of discrete log-based cryptography by using the restriction of scalars and the geometry and arithmetic of...
Karl Rubin, Alice Silverberg