Sciweavers

480 search results - page 69 / 96
» On the verification of automotive protocols
Sort
View
CCS
2006
ACM
13 years 11 months ago
Replayer: automatic protocol replay by binary analysis
We address the problem of replaying an application dialog between two hosts. The ability to accurately replay application dialogs is useful in many security-oriented applications,...
James Newsome, David Brumley, Jason Franklin, Dawn...
FMOODS
2006
13 years 8 months ago
Bounded Analysis and Decomposition for Behavioural Descriptions of Components
Abstract. Explicit behavioural interfaces are now accepted as a mandatory feature of components to address architectural analysis. Behavioural interface description languages shoul...
Pascal Poizat, Jean-Claude Royer, Gwen Salaün
CONCUR
2010
Springer
13 years 7 months ago
Conditional Automata: A Tool for Safe Removal of Negligible Events
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
Roberto Segala, Andrea Turrini
CSI
2008
75views more  CSI 2008»
13 years 7 months ago
Identity-based universal designated multi-verifiers signature schemes
An identity-based (ID-based) universal designated verifier signature (ID-UDVS) scheme allows a signature holder to designate a specific verifier of the signature by using a simpli...
Seung-Hyun Seo, Jung Yeon Hwang, Kyu Young Choi, D...
SIGMETRICS
2008
ACM
130views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Using probabilistic model checking in systems biology
Probabilistic model checking is a formal verification framework for systems which exhibit stochastic behaviour. It has been successfully applied to a wide range of domains, includ...
Marta Z. Kwiatkowska, Gethin Norman, David Parker