Sciweavers

24 search results - page 1 / 5
» A Structured Approach to Proving Compiler Optimizations Base...
Sort
View
67
Voted
TYPES
2004
Springer
15 years 2 months ago
A Structured Approach to Proving Compiler Optimizations Based on Dataflow Analysis
Yves Bertot, Benjamin Grégoire, Xavier Lero...
79
Voted
CGO
2008
IEEE
14 years 11 months ago
Comprehensive path-sensitive data-flow analysis
Data-flow analysis is an integral part of any aggressive optimizing compiler. We propose a framework for improving the precision of data-flow analysis in the presence of complex c...
Aditya V. Thakur, R. Govindarajan
ENTCS
2007
124views more  ENTCS 2007»
14 years 9 months ago
Structuring Optimizing Transformations and Proving Them Sound
A compiler optimization is sound if the optimized program that it produces is semantically equivalent to the input program. The proofs of semantic equivalence are usually tedious....
Aditya Kanade, Amitabha Sanyal, Uday P. Khedker
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...
CC
2008
Springer
172views System Software» more  CC 2008»
14 years 11 months ago
Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models
The performance of heap analysis techniques has a significant impact on their utility in an optimizing compiler. Most shape analysis techniques perform interprocedural dataflow ana...
Mark Marron, Manuel V. Hermenegildo, Deepak Kapur,...