Sciweavers

351 search results - page 39 / 71
» Classical proof forestry
Sort
View
CORR
2010
Springer
128views Education» more  CORR 2010»
13 years 7 months ago
Random Oracles in a Quantum World
Once quantum computers reach maturity most of today's traditional cryptographic schemes based on RSA or discrete logarithms become vulnerable to quantum-based attacks. Hence, ...
Özgür Dagdelen, Marc Fischlin, Anja Lehm...
JCO
2008
102views more  JCO 2008»
13 years 7 months ago
Stable matching problems with exchange restrictions
We study variants of classical stable matching problems in which there is an additional requirement for a stable matching, namely that there should not be two participants who wou...
Robert W. Irving
TPHOL
2005
IEEE
14 years 1 months ago
A Structured Set of Higher-Order Problems
Abstract. We present a set of problems that may support the development of calculi and theorem provers for classical higher-order logic. We propose to employ these test problems as...
Christoph Benzmüller, Chad E. Brown
ASM
2010
ASM
14 years 2 months ago
Using Event-B to Verify the Kmelia Components and Their Assemblies
and formal model, named Kmelia [1,2], with an associated language to specify components, their provided and required services and their assemblies; we also developed a framework na...
Pascal André, Gilles Ardourel, Christian At...
ACSAC
2009
IEEE
13 years 11 months ago
Justifying Integrity Using a Virtual Machine Verifier
Emerging distributed computing architectures, such as grid and cloud computing, depend on the high integrity execution of each system in the computation. While integrity measuremen...
Joshua Schiffman, Thomas Moyer, Christopher Shal, ...