Sciweavers

2687 search results - page 360 / 538
» Formal Analysis of PKCS
Sort
View
NCA
2005
IEEE
16 years 3 days ago
Fundamental Network Processor Performance Bounds
In this paper, fundamental conditions which bound the network processing unit (NPU) worst-case performance are established. In particular, these conditions formalize and integrate...
Hao Che, Chethan Kumar, Basavaraj Menasinahal
MMSEC
2005
ACM
131views Multimedia» more  MMSEC 2005»
16 years 3 days ago
Capacity of steganographic channels
—This work investigates a central problem in steganography, that is: How much data can safely be hidden without being detected? To answer this question a formal definition of st...
Jeremiah J. Harmsen, William A. Pearlman
ATAL
2005
Springer
16 years 2 days ago
Foundations of organizational structures in multiagent systems
We analyze the notion of organizational structure in multiagent systems and explain the precise added value and the effects of such organizational structure on the involved agents...
Davide Grossi, Frank Dignum, Mehdi Dastani, Lamb&e...
BPM
2005
Springer
129views Business» more  BPM 2005»
16 years 2 days ago
Transforming BPEL to Petri Nets
We present a Petri net semantics for the Business Process Execution Language for Web Services (BPEL). Our semantics covers the standard behaviour of BPEL as well as the exceptional...
Sebastian Hinz, Karsten Schmidt 0004, Christian St...
CAV
2005
Springer
122views Hardware» more  CAV 2005»
16 years 2 days ago
Interpolant-Based Transition Relation Approximation
Abstract. In predicate abstraction, exact image computation is problematic, requiring in the worst case an exponential number of calls to a decision procedure. For this reason, sof...
Ranjit Jhala, Kenneth L. McMillan