Sciweavers

544 search results - page 82 / 109
» The Algebra of Equality Proofs
Sort
View
CSFW
2009
IEEE
13 years 12 months ago
Using ProVerif to Analyze Protocols with Diffie-Hellman Exponentiation
ProVerif is one of the most successful tools for cryptographic protocol analysis. However, dealing with algebraic properties of operators such as the exclusive OR (XOR) and Diffie-...
Ralf Küsters, Tomasz Truderung
CORR
2006
Springer
108views Education» more  CORR 2006»
13 years 8 months ago
Two polygraphic presentations of Petri nets
: This document gives an algebraic and two polygraphic translations of Petri nets, all three providing an easier way to describe reductions and to identify some of them. The first ...
Yves Guiraud
GECCO
2003
Springer
14 years 1 months ago
Quad Search and Hybrid Genetic Algorithms
A bit climber using a Gray encoding is guaranteed to converge to a global optimum in fewer than ¢¤£¦¥¨§© evaluations on unimodal 1-D functions and on multi-dimensional sph...
L. Darrell Whitley, Deon Garrett, Jean-Paul Watson
PPDP
2005
Springer
14 years 1 months ago
Formal validation of pattern matching code
When addressing the formal validation of generated software, two main alternatives consist either to prove the correctness of compilers or to directly validate the generated code....
Claude Kirchner, Pierre-Etienne Moreau, Antoine Re...
ISW
2004
Springer
14 years 1 months ago
Low-Level Ideal Signatures and General Integrity Idealization
Abstract. Recently we showed how to justify a Dolev-Yao type model of cryptography as used in virtually all automated protocol provers under active attacks and in arbitrary protoco...
Michael Backes, Birgit Pfitzmann, Michael Waidner