Sciweavers

4 search results - page 1 / 1
» Automated soundness proofs for dataflow analyses and transfo...
Sort
View
153
Voted
POPL
2005
ACM
15 years 10 months ago
Automated soundness proofs for dataflow analyses and transformations via local rules
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...
Sorin Lerner, Todd D. Millstein, Erika Rice, Craig...
PEPM
2009
ACM
15 years 6 months ago
Bidirectional data-flow analyses, type-systematically
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...
Maria João Frade, Ando Saabas, Tarmo Uustal...
ATAL
2000
Springer
15 years 1 months ago
Determining the Envelope of Emergent Agent Behaviour via Architectural Transformation
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 ...
Oswaldo Terán, Bruce Edmonds, Steve Wallis
PLDI
2003
ACM
15 years 2 months ago
Automatically proving the correctness of compiler optimizations
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
Sorin Lerner, Todd D. Millstein, Craig Chambers