Pathlistings applied to data flow analysis

DOI10.1007/BF00289306MaRDI QIDQ1155957zbMATH OpenOpenAlexFDO

Authors Jayashree Ramanathan, Ken Kennedy

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

• scientific article; zbMATH DE number 3485226 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3551830 (Why is no real title available?)
• scientific article; zbMATH DE number 3557197 (Why is no real title available?)
• scientific article; zbMATH DE number 3596260 (Why is no real title available?)
• scientific article; zbMATH DE number 3388535 (Why is no real title available?)
• A Fast and Usually Linear Algorithm for Global Flow Analysis
• A Simple Algorithm for Global Data Flow Analysis Problems
• A global flow analysis algorithm
• An empirical study of FORTRAN programs
• Characterizations of Reducible Flow Graphs
• Efficiency of a Good But Not Linear Set Union Algorithm
• Fast algorithms for the elimination of common subexpressions
• Finding Dominators in Directed Graphs
• Flow Graph Reducibility
• Global Data Flow Analysis and Iterative Algorithms
• High-level data flow analysis
• Lower bounds on the lengths of node sequences in directed graphs
• Safety of code motion

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

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