Sciweavers

13 search results - page 1 / 3
» Partial Redundancy Elimination with Predication Techniques
Sort
View
EUROPAR
2003
Springer
13 years 10 months ago
Partial Redundancy Elimination with Predication Techniques
Partial redundancy elimination (PRE) techniques play an important role in optimizing compilers. Many optimizations, such as elimination of redundant expressions, communication opti...
Bernhard Scholz, Eduard Mehofer, R. Nigel Horspool
MICRO
2000
IEEE
176views Hardware» more  MICRO 2000»
13 years 4 months ago
An Advanced Optimizer for the IA-64 Architecture
level of abstraction, compared with the program representation for scalar optimizations. For example, loop unrolling and loop unrolland-jam transformations exploit the large regist...
Rakesh Krishnaiyer, Dattatraya Kulkarni, Daniel M....
MUE
2007
IEEE
71views Multimedia» more  MUE 2007»
13 years 11 months ago
Query Predicate Preprocessing in Wireless Sensor Networks
With the developments of related techniques in telecommunication and computer sciences, wireless sensor networks have been used more and more widely. While sensor nodes in wireles...
Min Meng, Hui Xu, Byeong-Soo Jeong, Sungyoung Lee,...
POPL
2004
ACM
14 years 5 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
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 4 months ago
Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
Zachary Snow, David Baelde, Gopalan Nadathur