3333 search results - page 294 / 667 » Abstract Proof Search |
165
click to vote
TCC
2004
Springer
16 years 12 hour ago
2004
Springer
Abstract. Until recently, the existence of collection of trapdoor permutations (TDP) was believed (and claimed) to imply almost all of the major cryptographic primitives, including...
181
click to vote
TYPES
2004
Springer
16 years 11 hour ago
2004
Springer
Abstract. Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowl...
153
click to vote
TPHOL
2003
IEEE
15 years 12 months ago
2003
IEEE
Abstract. We show that certain input-output relations, termed inductive invariants are of central importance for termination proofs of algorithms defined by nested recursion. Indu...
165
click to vote
TPHOL
2003
IEEE
15 years 12 months ago
2003
IEEE
Abstract. Polytypic functions have mainly been studied in the context of functional programming languages. In that setting, applications of polytypism include elegant treatments of...
162
click to vote
CHARME
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. As of version 2.7, the ACL2 theorem prover has been extended to automatically verify sets of polynomial inequalities that include nonlinear relationships. In this paper w...