@inproceedings{262,
abstract = {{Programs from Proofs" is a generic method which generates new programs out of correctness proofs of given programs. The technique ensures that the new and given program are behaviorally equivalent and that the new program is easily verifiable, thus serving as an alternative to proof-carrying code concepts. So far, this generic method has one instantiation that verifies type-state properties of programs. In this paper, we present a whole range of new instantiations, all based on data ow analyses. More precisely, we show how an imprecise but fast data ow analysis can be enhanced with a predicate analysis as to yield a precise but expensive analysis. Out of the safety proofs of this analysis, we generate new programs, again behaviorally equivalent to the given ones, which are easily verifiable" in the sense that now the data ow analysis alone can yield precise results. An experimental evaluation practically supports our claim of easy verification.}},
author = {{Jakobs, Marie-Christine and Wehrheim, Heike}},
booktitle = {{Proceedings of the 30th Annual ACM Symposium on Applied Computing}},
pages = {{1729--1736}},
title = {{{Programs from Proofs of Predicated Dataflow Analyses}}},
doi = {{10.1145/2695664.2695690}},
year = {{2015}},
}