Computation and use of data flow information in optimizing compilers

DOI10.1007/BF00264579zbMath0413.68014OpenAlexW1986328875WikidataQ123241584 ScholiaQ123241584MaRDI QIDQ598799

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)

Related Items (6)

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

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