Sciweavers

554 search results - page 31 / 111
» Verifying Security Protocols Modelled by Networks of Automat...
Sort
View
CCS
2008
ACM
13 years 9 months ago
Secure neighbor discovery in wireless networks: formal investigation of possibility
Wireless communication enables a broad spectrum of applications, ranging from commodity to tactical systems. Neighbor discovery (ND), that is, determining which devices are within...
Marcin Poturalski, Panos Papadimitratos, Jean-Pier...
BCS
2008
13 years 9 months ago
Tools for Traceable Security Verification
Dependable systems evolution has been identified by the UK Computing Research Committee (UKCRC) as one of the current grand challenges for computer science. We present work toward...
Jan Jürjens, Yijun Yu, Andreas Bauer 0002
ASE
2002
160views more  ASE 2002»
13 years 7 months ago
Proving Invariants of I/O Automata with TAME
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
Myla Archer, Constance L. Heitmeyer, Elvinia Ricco...
ENTCS
2006
173views more  ENTCS 2006»
13 years 7 months ago
Formal Security Analysis for Ad-Hoc Networks
In ad-hoc networks, autonomous wireless nodes can communicate by forwarding messages for each other. For routing protocols in this setting, it is known that a malicious node can p...
Sebastian Nanz, Chris Hankin
NSDI
2004
13 years 9 months ago
Model Checking Large Network Protocol Implementations
Network protocols must work. The effects of protocol specification or implementation errors range from reduced performance, to security breaches, to bringing down entire networks....
Madanlal Musuvathi, Dawson R. Engler