2687 search results - page 186 / 538 » Formal Analysis of PKCS |
146
click to vote
CCS
2005
ACM
15 years 10 months 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...
137
click to vote
FM
2005
Springer
15 years 10 months 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...
138
click to vote
CAV
2004
Springer
15 years 10 months 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...
135
click to vote
WORDS
2003
IEEE
15 years 9 months 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...
135
Voted
FORMATS
2003
Springer
15 years 9 months 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...