1818 search results - page 61 / 364 » Granularity-Adaptive Proof Presentation |
AMAI
1999
Springer
13 years 8 months ago
1999
Springer
In this paper we present an extension of logic programming (LP) that is suitable not only for the "rational" component of a single agent but also for the "reactive&...
IACR
2011
12 years 8 months ago
2011
We present a generic transformation that allows us to use a large class of pairing-based signatures to construct schemes for signing group elements in a structure preserving way. A...
POPL
2009
ACM
14 years 9 months ago
2009
ACM
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
CADE
2011
Springer
12 years 8 months ago
2011
Springer
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
LICS
2002
IEEE
14 years 1 months ago
2002
IEEE
Proof-Carrying Code (PCC) is a general framework for verifying the safety properties of machine-language programs. PCC proofs are usually written in a logic extended with language...