Sciweavers

10715 search results - page 53 / 2143
» From Tests to Proofs
Sort
View
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
14 years 9 months ago
Narrow proofs may be spacious: separating space and width in resolution
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...
Jakob Nordström
PKC
2007
Springer
99views Cryptology» more  PKC 2007»
14 years 3 months ago
Full-Domain Subgroup Hiding and Constant-Size Group Signatures
We give a short constant-size group signature scheme, which we prove fully secure under reasonable assumptions in bilinear groups, in the standard model. We achieve this result by ...
Xavier Boyen, Brent Waters
ENTCS
2006
131views more  ENTCS 2006»
13 years 9 months ago
Development Separation in Lambda-Calculus
We present a proof technique in -calculus that can facilitate inductive reasoning on -terms by separating certain -developments from other -reductions. We give proofs based on thi...
Hongwei Xi
WOLLIC
2010
Springer
13 years 7 months ago
Mechanisation of PDA and Grammar Equivalence for Context-Free Languages
We provide a formalisation of the theory of pushdown automata (PDAs) using the HOL4 theorem prover. It illustrates how provers such as HOL can be used for mechanising complicated p...
Aditi Barthwal, Michael Norrish
FOCS
1992
IEEE
14 years 1 months ago
Probabilistic Checking of Proofs; A New Characterization of NP
We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilisticall...
Sanjeev Arora, Shmuel Safra