1302 search results - page 109 / 261 » Free-Style Theorem Proving |
151
click to vote
ACL2
2006
ACM
15 years 10 months ago
2006
ACM
We introduce the logical story behind file input in ACL2 and discuss the types of theorems that can be proven about filereading operations. We develop a low level library for re...
162
click to vote
FMSD
2002
15 years 4 months ago
2002
We present a new technique for verification of complex hardware devices that allows both generality andahighdegreeofautomation.Thetechniqueisbasedonournewwayofconstructinga"li...
129
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
This paper considers three variants of quantum interactive proof systems in which short (meaning logarithmic-length) messages are exchanged between the prover and verifier. The ...
135
click to vote
JCS
2010
15 years 2 months ago
2010
Protocol authentication properties are generally trace-based, meaning that authentication holds for the protocol if authentication holds for individual traces (runs of the protoco...
146
click to vote
JELIA
2010
Springer
15 years 2 months ago
2010
Springer
Traditionally, a logic program is built up to reason about atomic first-order formulas. The key idea of parametrized logic programming is that, instead of atomic first-order form...