A graph-free approach to data-flow analysis

MaRDI QIDQ4738372zbMATH OpenFDO

Authors Markus Mohnen

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2304/23040046.htm

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Computing methodologies and applications (68U99)

Recommendations

• An efficient general iterative algorithm for dataflow analysis
• Using locality of flow in dataflow analyses.
• Structurally defined conditional data-flow static analysis
• Data flow analysis as model checking
• scientific article; zbMATH DE number 3845083

Cited in

(14)

• An efficient general iterative algorithm for dataflow analysis
• On the detection of unstructuredness in flowgraphs
• On sparse evaluation representations
• Structurally defined conditional data-flow static analysis
• An efficient bitwise algorithm for intra-procedural data-flow testing coverage
• Julia: a fresh approach to numerical computing
• Combining model checking and data-flow analysis
• scientific article; zbMATH DE number 3845083 (Why is no real title available?)
• On Metapaths in Metagraphs
• Iterative-free program analysis
• EigenCFA, accelerating flow analysis with GPUs
• Improving flow analyses via ΓCFA
• Using locality of flow in dataflow analyses.
• Average case analysis of DJ graphs

This page was built for publication: A graph-free approach to data-flow analysis

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