1274 search results - page 11 / 255 » New Proofs for |
LICS
2002
IEEE
14 years 12 days ago
2002
IEEE
Proof-Carrying Code (PCC) is a general framework for verifying the safety properties of machine-language programs. PCC proofs are usually written in a logic extended with language...
EATCS
2000
13 years 7 months ago
2000
One of the previous articles in this column was devoted to the zero-one laws for a number of logics playing prominent role in finite model theory: first-order logic FO, the extens...
FOCS
2002
IEEE
14 years 14 days ago
2002
IEEE
We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity...
JCT
2010
13 years 6 months ago
2010
Combinatorial proofs are given for certain entries in Ramanujan’s lost notebook. Bijections of Sylvester, Franklin, Wright, and Yee are employed. A new bijection, involving the n...
LOGCOM
2000
13 years 7 months ago
2000
The criterion for confluence using decreasing diagrams is a generalization of several well-known confluence criteria act rewriting, such as the strong confluence lemma. We give a ...