Pathlistings applied to data flow analysis

DOI10.1007/BF00289306zbMath0467.68036OpenAlexW2044713792MaRDI QIDQ1155957

Ken Kennedy, Jayashree Ramanathan

Publication date: 1981

Published in: Acta Informatica (Search for Journal in Brave)

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

zbMATH Keywords

reducible flow graph

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower bounds on the lengths of node sequences in directed graphs
• Fast algorithms for the elimination of common subexpressions
• Finding Dominators in Directed Graphs
• Characterizations of Reducible Flow Graphs
• Efficiency of a Good But Not Linear Set Union Algorithm
• Global Data Flow Analysis and Iterative Algorithms
• A Fast and Usually Linear Algorithm for Global Flow Analysis
• A Simple Algorithm for Global Data Flow Analysis Problems
• High-level data flow analysis
• An empirical study of FORTRAN programs
• Safety of code motion
• A global flow analysis algorithm
• Flow Graph Reducibility

This page was built for publication: Pathlistings applied to data flow analysis