17 search results - page 2 / 4 » Proving Hard-Core Predicates Using List Decoding |
FOSSACS
2009
Springer
13 years 11 months ago
2009
Springer
Standard analysis on recursive data structures restrict their attention to shape properties (for instance, a program that manipulates a list returns a list), excluding properties t...
CAV
2007
Springer
13 years 11 months ago
2007
Springer
We propose a shape analysis that adapts to some of the complex composite data structures found in industrial systems-level programs. Examples of such data structures include “cyc...
TACAS
2007
Springer
13 years 11 months ago
2007
Springer
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...
SIAMCOMP
2010
13 years 3 months ago
2010
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
GLOBECOM
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract—Consider a communications system where the detector generates a mix of hard and soft outputs, which are then fed into a soft-input channel decoder. In such a setting, it...