13383 search results - page 242 / 2677 » Abstractions from proofs |
196
click to vote
COCO
1991
Springer
15 years 10 months ago
1991
Springer
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...
162
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
Abstract. The dependency pair technique is a powerful modular method for automated termination proofs of term rewrite systems. We first show that dependency pairs are also suitabl...
171
click to vote
SIROCCO
2010
15 years 8 months ago
2010
Abstract. We study strategies that minimize the instability of a faulttolerant consensus system. More precisely, we find the strategy than minimizes the number of output changes ov...
164
click to vote
FMOODS
2008
15 years 8 months ago
2008
This paper proposes a semantics-based automatic null pointer analysis for inferring non-null annotations of fields in objectoriented programs. The analysis is formulated for a mini...
145
click to vote
MSCS
2006
15 years 6 months ago
2006
Abstract. Lipschitz continuity is used as a tool for analyzing the relationship between incomputability and randomness. Having presented a simpler proof of one of the major results...