13383 search results - page 137 / 2677 » Abstractions from proofs |
176
Voted
EUROCRYPT
2008
Springer
15 years 8 months ago
2008
Springer
The Universal Composability framework was introduced by Canetti to study the security of protocols which are concurrently executed with other protocols in a network environment. U...
188
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
148
Voted
CHI
2005
ACM
15 years 8 months ago
2005
ACM
HIPs, or Human Interactive Proofs, are challenges meant to be easily solved by humans, while remaining too hard to be economically solved by computers. HIPs are increasingly used ...
183
Voted
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We consider an extension of bi-intuitionistic logic with the traditional modalities , , and from tense logic Kt. Proof theoretically, this extension is obtained simply by extendin...
212
Voted
AML
2011
15 years 1 months ago
2011
Any valid Ramsey statement n −→ (k)2 2 can be encoded into a DNF formula RAM(n, k) of size O(nk) and with terms of size k 2 . Let rk be the minimal n for which the statement h...