Sciweavers

641 search results - page 40 / 129
» Formal Reliability Analysis Using Theorem Proving
Sort
View
ESORICS
2009
Springer
16 years 2 months ago
Formal Indistinguishability Extended to the Random Oracle Model
Abstract. Several generic constructions for transforming one-way functions to asymmetric encryption schemes have been proposed. One-way functions only guarantee the weak secrecy of...
Cristian Ene, Yassine Lakhnech, Van Chan Ngo
ASPDAC
2004
ACM
94views Hardware» more  ASPDAC 2004»
15 years 6 months ago
Improving simulation-based verification by means of formal methods
The design of complex systems is largely ruled by the time needed for verification. Even though formal methods can provide higher reliability, in practice often simulation based ve...
Görschwin Fey, Rolf Drechsler
CDC
2010
IEEE
138views Control Systems» more  CDC 2010»
14 years 9 months ago
Consensus in non-commutative spaces
Convergence analysis of consensus algorithms is revisited in the light of the Hilbert distance. The Lyapunov function used in the early analysis by Tsitsiklis is shown to be the Hi...
Rodolphe Sepulchre, Alain Sarlette, Pierre Rouchon
JSS
2002
90views more  JSS 2002»
15 years 2 months ago
Producing reliable software: an experiment
A customer of high assurance software recently sponsored a software engineering experiment in which a small real-time software system was developed concurrently by two popular sof...
Carol Smidts, Xin Huang, James C. Widmaier
CORR
2007
Springer
141views Education» more  CORR 2007»
15 years 2 months ago
Acyclicity of Preferences, Nash Equilibria, and Subgame Perfect Equilibria: a Formal and Constructive Equivalence
Abstract. Sequential game and Nash equilibrium are basic key concepts in game theory. In 1953, Kuhn showed that every sequential game has a Nash equilibrium. The two main steps of ...
Stéphane Le Roux