Computation and use of data flow information in optimizing compilers

DOI10.1007/BF00264579MaRDI QIDQ598799zbMATH OpenOpenAlexWikidataFDO

Authors Reinhard Wilhelm

Publication date 1979

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00264579

zbMATH Keywords

program transformationsglobal data flow analysisoptimizing compiler

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited in

(6)

• Optimal incremental simple multi-pass attribute evaluation
• Pattern matching in trees and nets
• Analysis of program optimization possibilities and further development
• Attribute (re)evaluation in OPTRAN
• A modified tree-to-tree correction problem
• Average-case analysis of pattern-matching in trees under the BST probability model

This page was built for publication: Computation and use of data flow information in optimizing compilers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q598799)