Sciweavers

1894 search results - page 267 / 379
» A TLA Proof System
Sort
View
136
Voted
ASIACRYPT
2000
Springer
15 years 7 months ago
Round-Efficient Conference Key Agreement Protocols with Provable Security
A conference key protocol allows a group of participants to establish a secret communication (conference) key so that all their communications thereafter are protected by the key. ...
Wen-Guey Tzeng, Zhi-Jia Tzeng
CONCUR
2000
Springer
15 years 7 months ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko
ESORICS
2000
Springer
15 years 7 months ago
Authentication and Confidentiality via IPSEC
The IP security protocols (IPsec) may be used via security gateways that apply cryptographic operations to provide security services to datagrams, and this mode of use is supported...
Joshua D. Guttman, Amy L. Herzog, F. Javier Thayer
TACAS
2000
Springer
89views Algorithms» more  TACAS 2000»
15 years 7 months ago
The PROSPER Toolkit
Abstract. The Prosper (Proof and Specification Assisted Design Environments) project advocates the use of toolkits which allow existing verification tools to be adapted to a more f...
Louise A. Dennis, Graham Collins, Michael Norrish,...
ZUM
2000
Springer
107views Formal Methods» more  ZUM 2000»
15 years 7 months ago
How to Drive a B Machine
The B-Method is a state-based formal method that describes behaviour in terms of MACHINES whose states change under OPERATIONS. The process algebra CSP is an event-based formalism ...
Helen Treharne, Steve Schneider