Value Flow Graph Analysis with SATIrE

Author Gergö Barany



PDF
Thumbnail PDF

File

DagSemProc.08161.9.pdf
  • Filesize: 128 kB
  • 6 pages

Document Identifiers

Author Details

Gergö Barany

Cite As Get BibTex

Gergö Barany. Value Flow Graph Analysis with SATIrE. In Scalable Program Analysis. Dagstuhl Seminar Proceedings, Volume 8161, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008) https://doi.org/10.4230/DagSemProc.08161.9

Abstract

Partial redundancy elimination is a common program optimization that
attempts to improve execution time by removing superfluous computations from
a program.  There are two well-known classes of such techniques: syntactic
and semantic methods.  While semantic optimization is more powerful,
traditional algorithms based on SSA from are complicated, heuristic in
nature, and unable to perform certain useful optimizations.  The value flow
graph is a syntactic program representation modeling semantic equivalences;
it allows the combination of simple syntactic partial redundancy elimination
with a powerful semantic analysis.  This yields an optimization that is
computationally optimal and simpler than traditional semantic methods.

This talk discusses partial redundancy elimination using the value flow
graph.  A source-to-source optimizer for C++ was implemented using the
SATIrE program analysis and transformation system.  Two tools integrated in
SATIrE were used in the implementation: ROSE is a framework for arbitrary
analyses and source-to-source transformations of C++ programs, PAG is a tool
for generating data flow analyzers from functional specifications.

Subject Classification

Keywords
  • Partial redundancy elimination
  • value flow analysis
  • source-to-source optimization

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail