Safe approximation of data dependencies in pointer-based structures

DOI10.1007/3-540-45574-4_20MaRDI QIDQ4406697zbMATH OpenFDO

Authors D. K. Arvind, T. A. Lewis

Publication date 26 June 2003

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

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

Mathematics Subject Classification ID

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

Recommendations

• Experiences in analyzing data dependences for programs with pointers and structures
• Data dependence analysis in programs with pointers
• scientific article; zbMATH DE number 1224950
• A Systematic Approach to Probabilistic Pointer Analysis
• Languages and Compilers for Parallel Computing

Cited in

(3)

• scientific article; zbMATH DE number 1224950 (Why is no real title available?)
• Experiences in analyzing data dependences for programs with pointers and structures
• Detecting loop-carried dependences in programs with dynamic data structures

This page was built for publication: Safe approximation of data dependencies in pointer-based structures

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