Sciweavers

13 search results - page 3 / 3
» Partial Redundancy Elimination with Predication Techniques
Sort
View
PLDI
2003
ACM
13 years 10 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
EDBT
2006
ACM
127views Database» more  EDBT 2006»
14 years 5 months ago
Progressive Query Optimization for Federated Queries
Federated queries are regular relational queries accessing data on one or more remote relational or non-relational data sources, possibly combining them with tables stored in the ...
Stephan Ewen, Holger Kache, Volker Markl, Vijaysha...
TLDI
2005
ACM
151views Formal Methods» more  TLDI 2005»
13 years 11 months ago
Strict bidirectional type checking
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, ...
Adam J. Chlipala, Leaf Petersen, Robert Harper