53 search results - page 9 / 11 » Computationally Sound Mechanized Proofs of Correspondence As... |
CSR
2007
Springer
15 years 4 months ago
2007
Springer
t) Yuri Gurevich Microsoft Research The talk reflects recent joint work with Nachum Dershowitz [4]. In 1936, Church suggested that the recursive functions, which had been defined...
PPOPP
2010
ACM
15 years 7 months ago
2010
ACM
As concurrent programming becomes prevalent, software providers are investing in concurrency libraries to improve programmer productivity. Concurrency libraries improve productivi...
109
click to vote
LICS
2009
IEEE
15 years 4 months ago
2009
IEEE
Game semantics describe the interactive behavior of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing d...
176
click to vote
EUROPKI
2009
Springer
14 years 7 months ago
2009
Springer
Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many cryptographic applications such as identification schemes, group signatures, and secure mult...
FM
2006
Springer
15 years 1 months ago
2006
Springer
Security-critical systems are an important application area for formal methods. However, such systems often contain cryptographic subsystems. The natural definitions of these subsy...