171 search results - page 4 / 35 » CoSP: a general framework for computational soundness proofs |
ASIAN
2006
Springer
15 years 3 months ago
2006
Springer
In the investigation of the relationship between the formal and the computational view of cryptography, a recent approach, first proposed in [10], uses static equivalence from cryp...
129
click to vote
ACL2
2006
ACM
15 years 5 months ago
2006
ACM
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem proving framework. One must be able to represent and ...
TYPES
1999
Springer
15 years 3 months ago
1999
Springer
We propose a method to search for a lemma in a goq proof library by using the lemma type as a key. The method is based on the concept of type isomorphism developed within the funct...
115
click to vote
CSFW
2010
IEEE
15 years 2 months ago
2010
IEEE
Nowadays it is widely accepted to formulate the security of a protocol carrying out a given task via the "trusted-party paradigm," where the protocol execution is compar...
127
click to vote
ICLP
2010
Springer
14 years 10 months ago
2010
Springer
Abductive Logic Programming is a computationally founded representation of abductive reasoning. In most ALP frameworks, integrity constraints express domainspecific logical relati...