Sciweavers

184 search results - page 10 / 37
» Formal Verification of an Optimizing Compiler
Sort
View
ICFP
2001
ACM
14 years 6 months ago
Contification Using Dominators
Contification is a compiler optimization that turns a function that always returns to the same place into a continuation. Compilers for functional languages use contification to e...
Matthew Fluet, Stephen Weeks
FMCAD
2004
Springer
14 years 3 days ago
Late Design Changes (ECOs) for Sequentially Optimized Esterel Designs
Late changes in silicon design (ECO) is a common although undesired practice. The need for ECO exists even in high-level design flows since bugs may occur in the specifications, ...
Laurent Arditi, Gérard Berry, Michael Kishi...
IFL
2001
Springer
146views Formal Methods» more  IFL 2001»
13 years 11 months ago
Optimizations on Array Skeletons in a Shared Memory Environment
Map- and fold-like skeletons are a suitable abstractions to guide parallel program execution in functional array processing. However, when it comes to achieving high performance, i...
Clemens Grelck
POPL
2010
ACM
14 years 4 months ago
Generating Compiler Optimizations from Proofs
We present an automated technique for generating compiler optimizations from examples of concrete programs before and after improvements have been made to them. The key technical ...
Ross Tate, Michael Stepp, Sorin Lerner
POPL
2005
ACM
14 years 7 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...