3333 search results - page 145 / 667 » Abstract Proof Search |
139
click to vote
CADE
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. Proof-carrying code and other applications in computer security require machine-checkable proofs of properties of machine-language programs. These in turn require axioms ...
134
Voted
ICFEM
2000
Springer
15 years 7 months ago
2000
Springer
Retrenchment is presented in a simple relational framework as a more flexible development concept than refinement for capturing the early preformal stages of development, and brie...
158
click to vote
COCO
1991
Springer
15 years 7 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...
128
click to vote
DAGSTUHL
2007
15 years 5 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...
133
click to vote
SIROCCO
2010
15 years 5 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...