2687 search results - page 186 / 538 » Formal Analysis of PKCS |
195
Voted
CCS
2005
ACM
16 years 19 days ago
2005
ACM
d abstract) Prateek Gupta and Vitaly Shmatikov The University of Texas at Austin We present a cryptographically sound formal method for proving correctness of key exchange protoco...
186
click to vote
FM
2005
Springer
16 years 18 days ago
2005
Springer
This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniq...
198
Voted
CAV
2004
Springer
16 years 15 days ago
2004
Springer
—We introduce a new BDD-like data structure called Hybrid-Restriction Diagrams (HRDs) for the representation and manipulation of linear hybrid automata (LHA) state-spaces and pre...
181
Voted
WORDS
2003
IEEE
16 years 10 days ago
2003
IEEE
The execution time of software for hard real-time systems must be predictable. Further, safe and not overly pessimistic bounds for the worst-case execution time (WCET) must be com...
191
click to vote
FORMATS
2003
Springer
16 years 9 days ago
2003
Springer
This text is dedicated to modelling of real-time applications running under multitasking operating system. Theoretical background is based on timed automata by Alur and Dill. As th...