407 search results - page 33 / 82 » Malleable Proof Systems and Applications |
PPDP
2005
Springer
14 years 1 months ago
2005
Springer
We study contexts (terms with holes) by proposing a ‘λcalculus with holes’. It is very expressive and can encode programming constructs apparently unrelated to contexts, incl...
SRDS
2006
IEEE
14 years 1 months ago
2006
IEEE
Distributed snapshots are an important building block for distributed systems, and, among other applications, are useful for constructing efficient checkpointing protocols. In ad...
PODC
2003
ACM
14 years 25 days ago
2003
ACM
Applications such as e-commerce payment protocols, electronic contract signing, and certified e-mail delivery require that fair exchange be assured. A fair-exchange protocol allo...
COCO
2010
Springer
13 years 11 months ago
2010
Springer
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...
RTA
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. In this paper we present our formalization of two important termination techniques for term rewrite systems: the subterm criterion and the reduction pair processor in com...