scientific article; zbMATH DE number 3876561

MaRDI QIDQ3341865zbMATH OpenFDO

Authors Jeanne Ferrante, Karl J. Ottenstein, J. Warren

Publication date 1984

zbMATH Keywords

control dependencesData dependencesprogram dependence graphProgram transformations

Mathematics Subject Classification ID

Theory of operating systems (68N25) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• The program dependence graph and its use in optimization
• An optimal algorithm for the construction of the system dependence graph
• The dependence condition graph: precise conditions for dependence between program points
• scientific article; zbMATH DE number 1533817
• On the adequacy of dependence-based representations for programs with heaps

Cited in

(24)

• Combining preprocessor slicing with C/C++ language slicing
• The dependence condition graph: precise conditions for dependence between program points
• A novel formal approach to program slicing
• Semantics of program representation graphs
• A threaded abstract syntax tree based generation algorithm of program dependence graph
• Traces of Control-Flow Graphs
• The program dependence graph and its use in optimization
• scientific article; zbMATH DE number 177796 (Why is no real title available?)
• scientific article; zbMATH DE number 1251180 (Why is no real title available?)
• scientific article; zbMATH DE number 1956452 (Why is no real title available?)
• scientific article; zbMATH DE number 1533817 (Why is no real title available?)
• scientific article; zbMATH DE number 2087561 (Why is no real title available?)
• scientific article; zbMATH DE number 841576 (Why is no real title available?)
• Static Analysis
• System dependence graph construction for aspect oriented C++
• Optimization of a data dependence graph for the local microcode compaction problem. II: Algorithms and experimental verification
• Optimization of a data dependence graph for the local microcode compaction problem. I: Problem statement
• Computational Science - ICCS 2004
• An optimal algorithm for the construction of the system dependence graph
• Upper bound computation of information leakages for unbounded recursion
• The expression dependence graph
• Efficient comparison of program slices
• Properties of data flow frameworks: A unified model
• Slicing for architectural analysis

This page was built for publication:

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