1410 search results - page 122 / 282 » Proving theorems by reuse |
191
click to vote
CSFW
2012
IEEE
13 years 8 months ago
2012
IEEE
—In this paper, we propose a formal analysis of domain extenders for hash functions in the indifferentiability framework. We define a general model for domain extenders and prov...
124
click to vote
ICDCS
2005
IEEE
15 years 11 months ago
2005
IEEE
We prove two theorems saying that no distributed system in which processes coordinate using reliable registers and -resilient services can solve the consensus problem in the prese...
159
click to vote
ICFEM
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Theorem provers, model checkers, static analyzers, test generators. . . all of these and many other kinds of formal methods tools can contribute to the analysis and devel...
155
click to vote
POPL
1995
ACM
15 years 9 months ago
1995
ACM
The goal of program transformation is to improve efficiency while preserving meaning. One of the best known transformation techniques is Burstall and Darlington’s unfold-fold me...
176
click to vote
COMBINATORICS
1998
15 years 5 months ago
1998
A bivariate symmetric backwards recursion is of the form d[m, n] = w0(d[m− 1, n]+d[m, n−1])+ω1(d[m−r1, n−s1]+d[m−s1, n−r1])+· · ·+ωk(d[m−rk, n−sk] +d[m−sk, ...