17 search results - page 3 / 4 » Proving Hard-Core Predicates Using List Decoding |
AAAI
1996
13 years 6 months ago
1996
We formalize a model for supervised learning of action strategies in dynamic stochastic domains and show that PAC-learning results on Occam algorithms hold in this model as well. W...
PLDI
2011
ACM
12 years 8 months ago
2011
ACM
Program analysis and verification tools crucially depend on the ability to symbolically describe and reason about sets of program behaviors. Separation logic provides a promising...
CCS
2010
ACM
14 years 11 days ago
2010
ACM
In an attribute-based signature (ABS), users sign messages with any predicate of their attributes issued from an attribute authority. Under this notion, a signature attests not to...
POPL
2008
ACM
14 years 5 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
ICTAC
2010
Springer
13 years 3 months ago
2010
Springer
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...