338 search results - page 13 / 68 » Locally checkable proofs |
MKM
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The relationship between theorems and lemmas in mathematical reasoning is often vague. No system exists that formalizes the structure of theorems in a mathematical librar...
COCO
2004
Springer
14 years 1 months ago
2004
Springer
An NP search problem is the problems of finding a witness to the given NP predicate, and TFNP is the class of total NP search problems. TFNP contains a number of subclasses conta...
CAV
1998
Springer
14 years 4 days ago
1998
Springer
We present a systematic approach to decompose and incrementally build the proof of correctness of pipelined microprocessors. The central idea is to construct the abstraction funct...
AISC
2004
Springer
14 years 1 months ago
2004
Springer
ion Within Partial Deduction for Linear Logic . . . . . . . . . . . . . . . . . 52 P. K¨ungas A Decision Procedure for Equality Logic with Uninterpreted Functions . . . 66 O. Tver...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We consider the problem of intruder deduction in security protocol analysis: that is, deciding whether a given message M can be deduced from a set of messages under the theory of ...