13383 search results - page 25 / 2677 » Abstractions from proofs |
ITRUST
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Question answering systems users may find answers without any supporting information insufficient for determining trust levels. Once those question answering systems beg...
FAC
2008
13 years 10 months ago
2008
The Mondex case study about the specification and refinement of an electronic purse as defined in the Oxford Technical Monograph PRG-126 has recently been proposed as a challenge f...
LICS
2010
IEEE
13 years 8 months ago
2010
IEEE
This work belongs to a wider effort aimed at eliminating syntactic bureaucracy from proof systems. In this paper, we present a novel cut elimination procedure for classical propos...
LPAR
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification...
STACS
2001
Springer
14 years 2 months ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...