Sciweavers

5374 search results - page 4 / 1075
» The induction of communication protocols
Sort
View
FOCS
1992
IEEE
15 years 1 months ago
Separating the Communication Complexities of MOD m and MOD p Circuits
: We prove in this paper that it is much harder to evaluate depth
Vince Grolmusz
TAICPART
2010
IEEE
166views Education» more  TAICPART 2010»
14 years 8 months ago
Linguistic Security Testing for Text Communication Protocols
We introduce a new Syntax-based Security Testing (SST) framework that uses a protocol specification to perform security testing on text-based communication protocols. A protocol sp...
Ben W. Y. Kam, Thomas R. Dean
ARESEC
2011
104views more  ARESEC 2011»
13 years 9 months ago
An Inductive Approach to Provable Anonymity
—We formalise in a theorem prover the notion of provable anonymity proposed by Garcia et al. Our formalization relies on inductive definitions of message distinguish ability and...
Yongjian Li, Jun Pang
JUCS
2007
108views more  JUCS 2007»
14 years 9 months ago
Integrating Module Checking and Deduction in a Formal Proof for the Perlman Spanning Tree Protocol (STP)
: In the IEEE 802.1D standard for the Media Access Control layer (MAC layer) bridges, there is an STP (Spanning Tree Protocol) definition, based on the algorithm that was proposed...
Hossein Hojjat, Hootan Nakhost, Marjan Sirjani