4 search results - page 1 / 1 » Automated soundness proofs for dataflow analyses and transfo... |
POPL
2005
ACM
14 years 4 months ago
2005
ACM
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...
PEPM
2009
ACM
14 years 1 months ago
2009
ACM
We show that a wide class of bidirectional data-flow analyses and program optimizations based on them admit declarative descriptions in the form of type systems. The salient feat...
ATAL
2000
Springer
13 years 8 months ago
2000
Springer
In this paper we propose a methodology to help analyse tendencies in MAS to complement those of simple inspection, Monte Carlo and syntactic proof. We suggest an architecture that ...
PLDI
2003
ACM
13 years 9 months ago
2003
ACM
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...