13383 search results - page 158 / 2677 » Abstractions from proofs |
140
click to vote
TIT
2008
15 years 6 months ago
2008
We prove the strongest known bound for the risk of hypotheses selected from the ensemble generated by running a learning algorithm incrementally on the training data. Our result i...
155
click to vote
FLOPS
2010
Springer
16 years 1 months ago
2010
Springer
Disproof can be as important as proof in studying programs and programming languages. In particular, side conditions in a statement about program behavior are sometimes best unders...
170
click to vote
SAGT
2009
Springer
16 years 1 months ago
2009
Springer
Roberts’ theorem from 1979 states that the only incentive compatible mechanisms over a full domain and range of at least 3 are weighted variants of the VCG mechanism termed affin...
155
click to vote
APLAS
2005
ACM
16 years 2 days ago
2005
ACM
We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method...
157
click to vote
CASSIS
2004
Springer
15 years 12 months ago
2004
Springer
We present the Mobile Resource Guarantees framework: a system for ensuring that downloaded programs are free from run-time violations of resource bounds. Certificates are attached...