4099 search results - page 164 / 820 » A Framework for Interactive Proof |
151
click to vote
TCC
2004
Springer
15 years 10 months ago
2004
Springer
In earlier work, we described a “pathological” example of a signature scheme that is secure in the Random Oracle Model, but for which no secure implementation exists. For that...
129
click to vote
FATES
2003
Springer
15 years 10 months ago
2003
Springer
Most efforts to combine formal methods and software testing go in the direction of exploiting formal methods to solve testing problems, most commonly test case generation. Here we ...
170
click to vote
TYPES
1998
Springer
15 years 9 months ago
1998
Springer
Investigating soundness and completeness of verification calculi for imperative programming languages is a challenging task. Incorrect results have been published in the past. We t...
144
click to vote
STOC
1995
ACM
15 years 9 months ago
1995
ACM
We show that a parallel repetition of any two-prover one-round proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previou...
150
click to vote
LICS
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...