1818 search results - page 109 / 364 » Granularity-Adaptive Proof Presentation |
141
click to vote
LICS
1994
IEEE
15 years 7 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
115
Voted
FMCAD
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We present a simple method for verifying the safety properties of cache coherence protocols with arbitrarily many nodes. Our presentation begins with two examples. The fi...
157
click to vote
ESOP
2006
Springer
15 years 7 months ago
2006
Springer
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
149
click to vote
EUROCRYPT
2000
Springer
15 years 7 months ago
2000
Springer
The cryptosystem recently proposed by Cramer and Shoup [CS98] is a practical public key cryptosystem that is secure against adaptive chosen ciphertext attack provided the Decision...
136
click to vote
ATVA
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Non-freely generated data types are widely used in case studies carried out in the theorem prover KIV. The most common examples are stores, sets and arrays. We present an...