6978 search results - page 200 / 1396 » On Proofs in System P |
302
click to vote
ICFP
2009
ACM
16 years 7 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...
149
click to vote
SYNASC
2007
IEEE
16 years 25 days ago
2007
IEEE
In this technical report we present the proofs of properties appearing when solving the problem of prime decomposition of natural numbers using a scheme-based systematic exploratio...
178
click to vote
ICALP
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
201
click to vote
STACS
2005
Springer
16 years 1 days ago
2005
Springer
This paper studies quantum refereed games, which are quantum interactive proof systems with two competing provers: one that tries to convince the verifier to accept and the other...
168
click to vote
ENTCS
2002
15 years 6 months ago
2002
We describe a proof dedicated meta-language, called Ltac, in the context of the Coq proof assistant. This new layer of meta-language is quite appropriate to write small and local ...