1496 search results - page 280 / 300 » Definability of Initial Segments |
POPL
2009
ACM
14 years 9 months ago
2009
ACM
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
EUROCRYPT
2009
Springer
14 years 9 months ago
2009
Springer
The notion of Zero Knowledge Proofs (of knowledge) [ZKP] is central to cryptography; it provides a set of security properties that proved indispensable in concrete protocol design...
TCC
2009
Springer
14 years 9 months ago
2009
Springer
Extractable functions are functions where any adversary that outputs a point in the range of the function is guaranteed to "know" a corresponding preimage. Here, knowledg...
POPL
2007
ACM
14 years 9 months ago
2007
ACM
C programs can be difficult to debug due to lax type enforcement and low-level access to memory. We present a dynamic analysis for C that checks heap snapshots for consistency wit...
OSDI
2008
ACM
14 years 9 months ago
2008
ACM
The increasing use of computers for saving valuable data imposes stringent reliability constraints on storage systems. Reliability improvement via use of redundancy is a common pr...