Sciweavers

38 search results - page 4 / 8
» Linking the Meaning of Programs to What the Compiler Can Ver...
Sort
View
ICFP
2000
ACM
13 years 11 months ago
Intersection types and computational effects
We show that standard formulations of intersection type systems are unsound in the presence of computational effects, and propose a solution similar to the value restriction for ...
Rowan Davies, Frank Pfenning
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...
IQ
1997
13 years 8 months ago
Total Data Quality Management: The Case of IRI
Implementing a Total Data Quality Management (TDQM) program is not a trivial undertaking. Two key steps are (1) to clearly define what an organization means by data quality and (2...
Rita Kovac, Yang W. Lee, Leo Pipino
DAC
2007
ACM
14 years 7 months ago
Implicitly Parallel Programming Models for Thousand-Core Microprocessors
This paper argues for an implicitly parallel programming model for many-core microprocessors, and provides initial technical approaches towards this goal. In an implicitly paralle...
Wen-mei W. Hwu, Shane Ryoo, Sain-Zee Ueng, John H....
POPL
2004
ACM
14 years 7 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton