Sciweavers

4036 search results - page 437 / 808
» Formal Methods
Sort
View
CCS
2005
ACM
16 years 9 days ago
Towards computationally sound symbolic analysis of key exchange protocols
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...
Prateek Gupta, Vitaly Shmatikov
FMCO
2005
Springer
16 years 9 days ago
A Software Component Model and Its Preliminary Formalisation
A software component model should define what components are, and how they can be composed. That is, it should define a theory of components and their composition. Current softwa...
Kung-Kiu Lau, Mario Ornaghi, Zheng Wang
FMCAD
2004
Springer
16 years 4 days ago
Approximate Symbolic Model Checking for Incomplete Designs
We consider the problem of checking whether an incomplete design can still be extended to a complete design satisfying a given CTL formula and whether the property is satisfied fo...
Tobias Nopper, Christoph Scholl
FORMATS
2004
Springer
16 years 4 days ago
Symbolic Model Checking for Probabilistic Timed Automata
Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
FM
2003
Springer
114views Formal Methods» more  FM 2003»
15 years 12 months ago
ProB: A Model Checker for B
We present ProB, an animation and model checking tool for the B method. ProB’s animation facilities allow users to gain confidence in their specifications, and unlike the anima...
Michael Leuschel, Michael J. Butler