1410 search results - page 216 / 282 » Proving theorems by reuse |
ASIACRYPT
2011
Springer
12 years 10 months ago
2011
Springer
The assumption of the availability of tamper-proof hardware tokens has been used extensively in the design of cryptographic primitives. For example, Katz (Eurocrypt 2007) suggests ...
POPL
2012
ACM
12 years 5 months ago
2012
ACM
Formal models serve in many roles in the programming language community. In its primary role, a model communicates the idea of a language design; the architecture of a language to...
STOC
2009
ACM
14 years 10 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
PPDP
2005
Springer
14 years 3 months ago
2005
Springer
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....