Sciweavers

888 search results - page 105 / 178
» The Power of Temporal Proofs
Sort
View
CARDIS
1998
Springer
89views Hardware» more  CARDIS 1998»
15 years 2 months ago
Implementation of a Provably Secure, Smartcard-Based Key Distribution Protocol
We describe the implementation of the Shoup-Rubin key distribution protocol. This protocol stores long-term keys on a smartcard and uses the cryptographic capability of the card t...
Rob Jerdonek, Peter Honeyman, Kevin Coffman, Jim R...
TACAS
1997
Springer
87views Algorithms» more  TACAS 1997»
15 years 2 months ago
Integration in PVS: Tables, Types, and Model Checking
Abstract. We have argued previously that the e ectiveness of a veri cation system derives not only from the power of its individual features for expression and deduction, but from ...
Sam Owre, John M. Rushby, Natarajan Shankar
COCO
1994
Springer
89views Algorithms» more  COCO 1994»
15 years 2 months ago
Relationships Among PL, #L, and the Determinant
Recent results by Toda, Vinay, Damm, and Valiant have shown that the complexity of the determinant is characterized by the complexity of counting the number of accepting computati...
Eric Allender, Mitsunori Ogihara
APLAS
2007
ACM
15 years 2 months ago
Complete Lattices and Up-To Techniques
Abstract. We propose a theory of up-to techniques for proofs by coinduction, in the setting of complete lattices. This theory improves over existing results by providing a way to c...
Damien Pous
ATVA
2006
Springer
160views Hardware» more  ATVA 2006»
15 years 1 months ago
Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols
Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e....
Giorgio Delzanno, Javier Esparza, Jirí Srba