Sciweavers

10568 search results - page 1609 / 2114
» Computer Intelligence and Formalization
Sort
View
CAV
2005
Springer
129views Hardware» more  CAV 2005»
16 years 22 days ago
Symbolic Systems, Explicit Properties: On Hybrid Approaches for LTL Symbolic Model Checking
In this work we study hybrid approaches to LTL symbolic model checking; that is, approaches that use explicit representations of the property automaton, whose state space is often ...
Roberto Sebastiani, Stefano Tonetta, Moshe Y. Vard...
CCS
2005
ACM
16 years 22 days ago
A modular correctness proof of IEEE 802.11i and TLS
The IEEE 802.11i wireless networking protocol provides mutual authentication between a network access point and user devices prior to user connectivity. The protocol consists of s...
Changhua He, Mukund Sundararajan, Anupam Datta, An...
CIE
2005
Springer
16 years 22 days ago
Formalising Exact Arithmetic in Type Theory
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Potts and Edalat [1]. We choose the constructive type theory as our formal verification t...
Milad Niqui
CSL
2005
Springer
16 years 22 days ago
Feasible Proofs of Matrix Properties with Csanky's Algorithm
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
Michael Soltys
CTRSA
2005
Springer
72views Cryptology» more  CTRSA 2005»
16 years 22 days ago
Proofs for Two-Server Password Authentication
Traditional password-based authentication and key-exchange protocols suffer from the simple fact that a single server stores the sensitive user password. In practice, when such a ...
Michael Szydlo, Burton S. Kaliski Jr.
« Prev « First page 1609 / 2114 Last » Next »