Experiences in analyzing data dependences for programs with pointers and structures

DOI10.1007/BFB0002754MaRDI QIDQ4536953zbMATH OpenFDO

Authors Wolfram Amme, Eberhard Zehendner

Publication date 25 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0002754

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Computing methodologies and applications (68U99)

Recommendations

• Data dependence analysis in programs with pointers
• Safe approximation of data dependencies in pointer-based structures
• scientific article; zbMATH DE number 1224950
• Automatic analysis of pointer aliasing for untyped programs
• Alias analysis pointers in Pascal and Fortran 90. I: Dependence analysis between pointer references

Cited in

(8)

• Data dependence analysis in programs with pointers
• Alias analysis pointers in Pascal and Fortran 90. I: Dependence analysis between pointer references
• scientific article; zbMATH DE number 1224950 (Why is no real title available?)
• scientific article; zbMATH DE number 1251180 (Why is no real title available?)
• Safe approximation of data dependencies in pointer-based structures
• Nonuniform alias analysis of recursive data structures and arrays
• Efficient dependence analysis for Java arrays
• Detecting loop-carried dependences in programs with dynamic data structures

This page was built for publication: Experiences in analyzing data dependences for programs with pointers and structures

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