Sciweavers

188 search results - page 18 / 38
» What Is a Skeptical Proof
Sort
View
IANDC
2007
133views more  IANDC 2007»
13 years 7 months ago
On decidability of monadic logic of order over the naturals extended by monadic predicates
A fundamental result of Büchi states that the set of monadic second-order formulas true in the structure (Nat, <) is decidable. A natural question is: what monadic predicates ...
Alexander Rabinovich
IACR
2011
94views more  IACR 2011»
12 years 7 months ago
After-the-Fact Leakage in Public-Key Encryption
What does it mean for an encryption scheme to be leakage-resilient? Prior formulations require that the scheme remains semantically secure even in the presence of leakage, but onl...
Shai Halevi, Huijia Lin
DCC
2004
IEEE
14 years 7 months ago
Parameter Inequalities for Orthogonal Arrays with Mixed Levels
An important question in the construction of orthogonal arrays is what the minimal size of an array is when all other parameters are fixed. In this paper, we will provide a genera...
Wiebke S. Diestelkamp
POPL
2010
ACM
14 years 4 months ago
Verified just-in-time compiler on x86
This paper presents a method for creating formally correct just-intime (JIT) compilers. The tractability of our approach is demonstrated through, what we believe is the first, ver...
Magnus O. Myreen
VLDB
2007
ACM
144views Database» more  VLDB 2007»
14 years 1 months ago
A Relational Approach to Incrementally Extracting and Querying Structure in Unstructured Data
There is a growing consensus that it is desirable to query over the structure implicit in unstructured documents, and that ideally this capability should be provided incrementally...
Eric Chu, Akanksha Baid, Ting Chen, AnHai Doan, Je...