Properties of data flow frameworks: A unified model (Q910237): Difference between revisions

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.

0 references

Mathematics Subject Classification ID

68N99

0 references

zbMATH DE Number

4139303

0 references

zbMATH Keywords

data flow frameworks

0 references

author

Thomas J. jun. Marlowe

0 references

Barbara G. Ryder

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Q5452362

0 references

A program data flow analysis procedure

0 references

Automatic translation of FORTRAN programs to vector form

0 references

Register Assignment Algorithm for Generation of Highly Optimized Object Code

0 references

Q5532570

0 references

Program derivation by fixed point computation

0 references

Sometime = always + recursion \(\equiv\) always. On the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs

0 references

Constructive versions of Tarski's fixed point theorems

0 references

A simple fixpoint argument without the restriction to continuity

0 references

The program dependence graph and its use in optimization

0 references

A Fast and Usually Linear Algorithm for Global Flow Analysis

0 references

Q4162449

0 references

Q4068080

0 references

Q3862379

0 references

An efficient general iterative algorithm for dataflow analysis

0 references

Global Data Flow Analysis and Iterative Algorithms

0 references

Monotone data flow analysis frameworks

0 references

Q4068060

0 references

An empirical study of FORTRAN programs

0 references

The Theoretical Aspects of the Optimal Fixedpoint

0 references

The optimal approach to recursive programs

0 references

Properties of data flow frameworks: A unified model

0 references

Global optimization by suppression of partial redundancies

0 references

Q3341865

0 references

Efficient symbolic analysis of programs

0 references

Symbolic Program Analysis in Almost-Linear Time

0 references

Monoids for Rapid Data Flow Analysis

0 references

A Lubricant for Data Flow Analysis

0 references

Conditions for incremental iteration: Examples and counterexamples

0 references

Q5630556

0 references

Testing flow graph reducibility

0 references

Applications of Path Compression on Balanced Trees

0 references

A Unified Approach to Path Problems

0 references

Fast Algorithms for Solving Path Problems

0 references

Flow Graph Reducibility

0 references

Program Slicing

0 references

full work available at URL

https://doi.org/10.1007/bf01237234

0 references

OpenAlex ID

W2062764376

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:910237

@@ Property / cites work @@
+Q5452362
@@ Property / cites work: Q5452362 / rank @@
+Normal rank
@@ Property / cites work @@
+A program data flow analysis procedure
@@ Property / cites work: A program data flow analysis procedure / rank @@
+Normal rank
@@ Property / cites work @@
+Automatic translation of FORTRAN programs to vector form
+Normal rank
@@ Property / cites work @@
+Register Assignment Algorithm for Generation of Highly Optimized Object Code
+Normal rank
@@ Property / cites work @@
+Q5532570
@@ Property / cites work: Q5532570 / rank @@
+Normal rank
@@ Property / cites work @@
+Program derivation by fixed point computation
@@ Property / cites work: Program derivation by fixed point computation / rank @@
+Normal rank
@@ Property / cites work @@
+Sometime = always + recursion \(\equiv\) always. On the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs
+Normal rank
@@ Property / cites work @@
+Constructive versions of Tarski's fixed point theorems
+Normal rank
@@ Property / cites work @@
+A simple fixpoint argument without the restriction to continuity
+Normal rank
@@ Property / cites work @@
+The program dependence graph and its use in optimization
+Normal rank
@@ Property / cites work @@
+A Fast and Usually Linear Algorithm for Global Flow Analysis
+Normal rank
@@ Property / cites work @@
+Q4162449
@@ Property / cites work: Q4162449 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4068080
@@ Property / cites work: Q4068080 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient general iterative algorithm for dataflow analysis
+Normal rank
@@ Property / cites work @@
+Global Data Flow Analysis and Iterative Algorithms
+Normal rank
@@ Property / cites work @@
+Monotone data flow analysis frameworks
@@ Property / cites work: Monotone data flow analysis frameworks / rank @@
+Normal rank
@@ Property / cites work @@
+Q4068060
@@ Property / cites work: Q4068060 / rank @@
+Normal rank
@@ Property / cites work @@
+An empirical study of FORTRAN programs
@@ Property / cites work: An empirical study of FORTRAN programs / rank @@
+Normal rank
@@ Property / cites work @@
+The Theoretical Aspects of the Optimal Fixedpoint
@@ Property / cites work: The Theoretical Aspects of the Optimal Fixedpoint / rank @@
+Normal rank
@@ Property / cites work @@
+The optimal approach to recursive programs
@@ Property / cites work: The optimal approach to recursive programs / rank @@
+Normal rank
@@ Property / cites work @@
+Properties of data flow frameworks: A unified model
+Normal rank
@@ Property / cites work @@
+Global optimization by suppression of partial redundancies
+Normal rank
@@ Property / cites work @@
+Q3341865
@@ Property / cites work: Q3341865 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient symbolic analysis of programs
@@ Property / cites work: Efficient symbolic analysis of programs / rank @@
+Normal rank
@@ Property / cites work @@
+Symbolic Program Analysis in Almost-Linear Time
@@ Property / cites work: Symbolic Program Analysis in Almost-Linear Time / rank @@
+Normal rank
@@ Property / cites work @@
+Monoids for Rapid Data Flow Analysis
@@ Property / cites work: Monoids for Rapid Data Flow Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+A Lubricant for Data Flow Analysis
@@ Property / cites work: A Lubricant for Data Flow Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Conditions for incremental iteration: Examples and counterexamples
+Normal rank
@@ Property / cites work @@
+Q5630556
@@ Property / cites work: Q5630556 / rank @@
+Normal rank
@@ Property / cites work @@
+Testing flow graph reducibility
@@ Property / cites work: Testing flow graph reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+Applications of Path Compression on Balanced Trees
+Normal rank
@@ Property / cites work @@
+A Unified Approach to Path Problems
@@ Property / cites work: A Unified Approach to Path Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for Solving Path Problems
@@ Property / cites work: Fast Algorithms for Solving Path Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Flow Graph Reducibility
@@ Property / cites work: Flow Graph Reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+Program Slicing
@@ Property / cites work: Program Slicing / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01237234
+Normal rank
@@ Property / OpenAlex ID @@
+W2062764376
@@ Property / OpenAlex ID: W2062764376 / rank @@
+Normal rank