Sciweavers

13383 search results - page 122 / 2677
» Abstractions from proofs
Sort
View
ENTCS
2008
140views more  ENTCS 2008»
15 years 6 months ago
Higher-Order Separation Logic in Isabelle/HOLCF
We formalize higher-order separation logic for a first-order imperative language with procedures and local variables in Isabelle/HOLCF. The assertion language is modeled in such a...
Carsten Varming, Lars Birkedal
STOC
1999
ACM
101views Algorithms» more  STOC 1999»
15 years 10 months ago
Short Proofs are Narrow - Resolution Made Simple
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
Eli Ben-Sasson, Avi Wigderson
KBSE
2008
IEEE
16 years 13 days ago
PtYasm: Software Model Checking with Proof Templates
—We describe PTYASM, an enhanced version of the YASM software model checker which uses proof templates. These templates associate correctness arguments with common programming id...
Thomas E. Hart, Kelvin Ku, Arie Gurfinkel, Marsha ...
COCO
2005
Springer
141views Algorithms» more  COCO 2005»
15 years 11 months ago
Upper Bounds for Quantum Interactive Proofs with Competing Provers
Refereed games are interactive proof systems with two competing provers: one that tries to convince the verifier to accept and another that tries to convince the verifier to rej...
Gus Gutoski
CRYPTO
2005
Springer
103views Cryptology» more  CRYPTO 2005»
15 years 11 months ago
Pebbling and Proofs of Work
We investigate methods for providing easy-to-check proofs of computational effort. Originally intended for discouraging spam, the concept has wide applicability as a method for co...
Cynthia Dwork, Moni Naor, Hoeteck Wee