Properties of data flow frameworks: A unified model
type: Item
instance of: scholarly article
title: Properties of data flow frameworks: A unified model
zbMATH Open document ID: 0695.68049
DOI: 10.1007/BF01237234
published in: Acta Informatica
publication date: 1990-01-01T00:00:00Z
review text: A comprehensive overview of data flow frameworks and their characterizing properties is presented, to clarify property definitions and demonstrate their interrelation. Properties ensuring the existence of a solution are differentiated from those guaranteeing particular convergence behavior for specific solution procedures. Examples illustrate the orthogonality of these precision and convergence properties. In addition, several data flow problems are categorized with respect to these properties.
Mathematics Subject Classification ID: 68N99
zbMATH DE Number: 4139303
zbMATH Keywords: data flow frameworks
author: Thomas J. jun. Marlowe
author: Barbara G. Ryder
MaRDI profile type: Publication
cites work: Q5452362
cites work: A program data flow analysis procedure
cites work: Automatic translation of FORTRAN programs to vector form
cites work: Register Assignment Algorithm for Generation of Highly Optimized Object Code
cites work: Q5532570
cites work: Program derivation by fixed point computation
cites work: Sometime = always + recursion \(\equiv\) always. On the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs
cites work: Constructive versions of Tarski's fixed point theorems
cites work: A simple fixpoint argument without the restriction to continuity
cites work: The program dependence graph and its use in optimization
cites work: A Fast and Usually Linear Algorithm for Global Flow Analysis
cites work: Q4162449
cites work: Q4068080
cites work: Q3862379
cites work: An efficient general iterative algorithm for dataflow analysis
cites work: Global Data Flow Analysis and Iterative Algorithms
cites work: Monotone data flow analysis frameworks
cites work: Q4068060
cites work: An empirical study of FORTRAN programs
cites work: The Theoretical Aspects of the Optimal Fixedpoint
cites work: The optimal approach to recursive programs
cites work: Global optimization by suppression of partial redundancies
cites work: Q3341865
cites work: Efficient symbolic analysis of programs
cites work: Symbolic Program Analysis in Almost-Linear Time
cites work: Monoids for Rapid Data Flow Analysis
cites work: A Lubricant for Data Flow Analysis
cites work: Conditions for incremental iteration: Examples and counterexamples
cites work: Q5630556
cites work: Testing flow graph reducibility
cites work: Applications of Path Compression on Balanced Trees
cites work: A Unified Approach to Path Problems
cites work: Fast Algorithms for Solving Path Problems
cites work: Flow Graph Reducibility
cites work: Program Slicing
full work available at URL: https://doi.org/10.1007/bf01237234
OpenAlex ID: W2062764376
description: scientific article; zbMATH DE number 4139303