Sciweavers

480 search results - page 74 / 96
» On the verification of automotive protocols
Sort
View
FUIN
2008
92views more  FUIN 2008»
13 years 7 months ago
Translation of Timed Promela to Timed Automata with Discrete Data
The aim of the work is twofold. In order to face the problem of modeling time constraints in Promela, a timed extension of the language is presented. Next, timed Promela is transla...
Wojciech Nabialek, Agata Janowska, Pawel Janowski
TCS
2008
13 years 7 months ago
Sound and complete computational interpretation of symbolic hashes in the standard model
This paper provides one more step towards bridging the gap between the formal and computational approaches to the verification of cryptographic protocols. We extend the well-known ...
Flavio D. Garcia, Peter van Rossum
IJFCS
2006
110views more  IJFCS 2006»
13 years 7 months ago
Sat-based Model Checking for Region Automata
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this re...
Fang Yu, Bow-Yaw Wang
CSFW
2007
IEEE
14 years 1 months ago
Computationally Sound Mechanized Proofs of Correspondence Assertions
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
Bruno Blanchet
SAINT
2003
IEEE
14 years 20 days ago
Distributed Authentication for Peer-to-Peer Networks
A public key infrastructure is generally (and effectively) used for cryptographically secure authentication in the networks. Ad-hoc networks are formed in haphazard manner. Securi...
Shardul Gokhale, Partha Dasgupta