A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Transforming flow information during code optimization for timing analysis
2010
Real-time systems
Preserved Fulltext
In this article we present a method for transforming flow information from source code to machine code. ...
To obtain a mapping that is safe and accurate, flow information is transformed in parallel to code transformations performed by an optimizing compiler. ...
Timing Analysis" (COSTA) and within the research project "Sustaining Entire Code-Coverage on Code Optimization" (SECCO). ...
doi:10.1007/s11241-010-9091-8
fatcat:2s2aiyp5prgrdaqstvpn5iw334
An efficient approach to data flow analysis in a multiple pass global optimizer
1988
Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation - PLDI '88
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
mwcT Data flow analysis is a time-consuming part of the optimization process. ...
As transformations are made in a multiple pass global optimizer, the data flow information must be updated to reflect these changes. ...
The authors gratefully acknowledge significant contributions made to the design and implementation of the data flow analysis by Peter Canning, Debbie ...
doi:10.1145/53990.54006
dblp:conf/pldi/JainT88
fatcat:rha3mvfiofe5pd6bezib6wb4eu
LANCET
2005
The 6th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering - PASTE '05
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
As such, Lancet is an ideal tool to examine compiler-generated code, to assist the development of new compiler optimizations, or to optimize assembly code manually. ...
Implemented on top of the linktime rewriting framework Diablo, Lancet provides several views on the interprocedural control flow graph of a program. ...
The authors would like to thank the Institute for the Promotion of Innovation by Science and Technology in Flanders (IWT) and the Fund for Scientific Research Flanders (FWO) for their financial support ...
doi:10.1145/1108792.1108812
dblp:conf/paste/PutSMBCSB05
fatcat:4oa54ct5w5hjzdzog63csqpplq
LANCET
2006
Software engineering notes
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
As such, Lancet is an ideal tool to examine compiler-generated code, to assist the development of new compiler optimizations, or to optimize assembly code manually. ...
Implemented on top of the linktime rewriting framework Diablo, Lancet provides several views on the interprocedural control flow graph of a program. ...
The authors would like to thank the Institute for the Promotion of Innovation by Science and Technology in Flanders (IWT) and the Fund for Scientific Research Flanders (FWO) for their financial support ...
doi:10.1145/1108768.1108812
fatcat:pvac77ode5ckbhwhdvmma7a5we
Design of a WCET-Aware C Compiler
2006
2006 IEEE/ACM/IFIP Workshop on Embedded Systems for Real Time Multimedia
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Rather, it is possible to use our structures also for multi-objective optimization of e. g. best-case execution time (BCET) or energy dissipation. * This work is partially funded by the European IST FP6 ...
It opens up new possibilities for the design of WCET-aware optimizations in the future. ...
[12] presents techniques for transforming program path information during compiler optimization. ...
doi:10.1109/estmed.2006.321284
dblp:conf/estimedia/FalkLT06
fatcat:gwwwsls7xzbkljj5x7k55jeuim
Traceability of Flow Information
2014
Proceedings of the 22nd International Conference on Real-Time Networks and Systems - RTNS '14
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
For this reason, many WCET tools for real-time systems turn off compiler optimizations when computing WCET. ...
In this paper, we propose a framework to trace and maintain flow information from source code to machine code to benefit from optimizations, yet improving the WCET estimates. ...
Acknowledgments The research was funded by W-SEPT 5 , a collaborative research project focusing on identification and traceability of semantic information for worst-case execution time estimation. ...
doi:10.1145/2659787.2659805
dblp:conf/rtns/LiPR14
fatcat:h2t3e5lgmnaatlsoqa7sl74zke
A fresh look at optimizing array bound checking
1990
Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation - PLDI '90
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
A minimal control flow graph (MCFG) is constructed using which the minimal amount of data flow information required for range check optimizations is computed. ...
In addition to the elimination of range check:s, the optimizations discussed in this paper also reduce the overhead due to range checks that cannot be eliminated by compile-time analysis. ...
Acknowle'dgements -I am grateful to Mary Lou Soffa and the referees for their suggestions in improving this paper. ...
doi:10.1145/93542.93581
dblp:conf/pldi/Gupta90
fatcat:j2ku2kisvbcjtn5wchhvbwct4a
A fresh look at optimizing array bound checking
1990
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
A minimal control flow graph (MCFG) is constructed using which the minimal amount of data flow information required for range check optimizations is computed. ...
In addition to the elimination of range check:s, the optimizations discussed in this paper also reduce the overhead due to range checks that cannot be eliminated by compile-time analysis. ...
Acknowle'dgements -I am grateful to Mary Lou Soffa and the referees for their suggestions in improving this paper. ...
doi:10.1145/93548.93581
fatcat:m4fdic7xuveezdkjlgnczdjsei
Incremental global reoptimization of programs
1992
ACM Transactions on Programming Languages and Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
data flow information
that was current
when the block was last examined
for
affected transformations. ...
The analysis
for loop
optimizations
is included
in both the analysis
of locally affected optimizations
and the analysis
at a remote block where dominator
or data flow information
has changed ...
doi:10.1145/128861.128865
fatcat:i3ls64b5vnh4zbem52sdfb2cue
An optimizer for Ada - design, experiences and results
1988
Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation - PLDI '88
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Detailed measurements are prcl vided for a collection of benchmarks. The average improve ment of code speed is 40%. ...
In this paper we describe the design of a global machine independent low level optimizer for the Karlsruhe Ada Compiler. ...
Local Data Flow Analysis Local data flow analysis computes the summary information for one basic block. This is afterwards used to compute the global data flow information. ...
doi:10.1145/53990.54008
dblp:conf/pldi/SchwarzKL88
fatcat:z56hr5uj7zb2jofkclfk7hjz5y
A compiler framework for the reduction of worst-case execution times
2010
Real-time systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
All together, they help to obtain code explicitly optimized for its worst-case timing, to automate large parts of the real-time software design flow, and to reduce costs of a real-time system by allowing ...
There is almost no tool support that assists the designer in automatically deriving safe bounds of the worst-case execution time (WCET) of a system during code generation and in systematically optimizing ...
The final publication is available at www.springerlink.com Acknowledgements The authors would like to thank AbsInt Angewandte Informatik GmbH for their support related to WCET analysis using the aiT framework ...
doi:10.1007/s11241-010-9101-x
fatcat:atxsoqt32zga7mwlplsnydkj2a
Accelerating WCET-driven optimizations by the invariant path paradigm
2009
Proceedings of th 12th International Workshop on Software and Compilers for Embedded Systems - SCOPES '09
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
To keep path information valid, WCET optimizations typically perform a time-consuming static WCET analysis after each code modification to ensure that subsequent optimization steps operate on the critical ...
The worst-case execution time (WCET) being the upper bound of the maximum execution time corresponds to the longest path through the program's control flow graph. ...
Acknowledgments The authors would like to thank AbsInt Angewandte Informatik GmbH for their support concerning WCET analysis using the aiT framework. ...
doi:10.1145/1543820.1543823
fatcat:aasxiv24zzhs3aw3zg5skjicvi
Design and DSP Implementation of Fixed-Point Systems
2002
EURASIP Journal on Advances in Signal Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We introduce the novel approach to control and data flow analysis, which is necessary for the transformation. ...
FRIDGE also provides a direct link to DSP implementation by processor specific C code generation and advanced code optimization. ...
The information gained during this analysis is available for the back end code transformation as well. ...
doi:10.1155/s1110865702205065
fatcat:eblywytvyvhgff44biargqn5fi
A Modern Look at GRIN, an Optimizing Functional Language Back End
2021
Acta Cybernetica
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The GRIN framework allows for interprocedural whole program analysis, enabling optimizing code transformations across functions and modules as well. ...
Most of the currently available compilers for such languages share a common flaw: they can only optimize programs on a per-module basis. ...
Whole program analysis enables optimizations across modules. This type of data-flow analysis has all the available information about the program at once. ...
doi:10.14232/actacyb.282969
fatcat:ghpkxesdvvafvjki4z4djvhm74
BinRec
2020
Proceedings of the Fifteenth European Conference on Computer Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Binary lifting and recompilation allow a wide range of install-time program transformations, such as security hardening, deobfuscation, and reoptimization. ...
This enables BinRec to apply rich program transformations, such as compiler-based optimization passes, on top of the recovered representation. ...
Acknowledgments We thank our shepherd and the anonymous reviewers for their feedback. This material is based upon work partially supported by the Defense ...
doi:10.1145/3342195.3387550
dblp:conf/eurosys/AltinayNKRZDGNV20
fatcat:luiav7fu7zgtlahwcpt6wvkp3a
« Previous
Showing results 1 — 15 out of 256,708 results