4099 search results - page 14 / 820 » A Framework for Interactive Proof |
133
click to vote
LPAR
2004
Springer
15 years 3 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
ASIACRYPT
2007
Springer
15 years 1 months ago
2007
Springer
A shuffle is a permutation and re-encryption of a set of ciphertexts. Shuffles are for instance used in mix-nets for anonymous broadcast and voting. One way to make a shuffle verif...
CADE
2004
Springer
15 years 10 months ago
2004
Springer
Interactive theorem provers can model complex systems, but require much effort to prove theorems. Resolution theorem provers are automatic and powerful, but they are designed to be...
JAR
2007
14 years 9 months ago
2007
Matita is a new, document-centric, tactic-based interactive theorem prover. This paper focuses on some of the distinctive features of the user interaction with Matita, characterize...
166
click to vote
ICFP
2009
ACM
15 years 10 months ago
2009
ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...