Sciweavers

3228 search results - page 382 / 646
» Computationally Sound Proofs
Sort
View
SP
2006
IEEE
136views Security Privacy» more  SP 2006»
16 years 20 days ago
Simulatable Security and Polynomially Bounded Concurrent Composability
Simulatable security is a security notion for multi-party protocols that implies strong composability features. The main definitional flavours of simulatable security are standa...
Dennis Hofheinz, Dominique Unruh
ACL2
2006
ACM
16 years 19 days ago
Unique factorization in ACL2: Euclidean domains
ACL2 is used to systematically study domains whose elements can be “uniquely” factored into products of “irreducible” elements. The best known examples of such domains are...
John R. Cowles, Ruben Gamboa
156
Voted
TPHOL
2005
IEEE
16 years 7 days ago
On the Correctness of Operating System Kernels
The Verisoft project aims at the pervasive formal verification of entire computer systems. In particular, the seamless verification of the academic system is attempted. This syst...
Mauro Gargano, Mark A. Hillebrand, Dirk Leinenbach...
SACRYPT
2004
Springer
113views Cryptology» more  SACRYPT 2004»
16 years 14 hour ago
A Note on the Signed Sliding Window Integer Recoding and a Left-to-Right Analogue
Addition-subtraction-chains obtained from signed digit recodings of integers are a common tool for computing multiples of random elements of a group where the computation of invers...
Roberto Maria Avanzi
FCT
1999
Springer
15 years 11 months ago
On Recognizable Languages in Divisibility Monoids
Kleene’s theorem on recognizable languages in free monoids is considered to be of eminent importance in theoretical computer science. It has been generalized into various directi...
Manfred Droste, Dietrich Kuske