Efficient dependence analysis for Java arrays

DOI10.1007/3-540-44681-8_39MaRDI QIDQ4791902zbMATH OpenFDO

Authors Vivek Sarkar, Stephen J. Fink

Publication date 4 February 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/2150/21500273

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Theory of compilers and interpreters (68N20) Computing methodologies and applications (68U99)

Recommendations

• Alias analysis in Java with reference-set representation for high-performance computing
• Data dependence analysis in programs with pointers
• scientific article; zbMATH DE number 4064447
• Experiences in analyzing data dependences for programs with pointers and structures
• Detecting loop-carried dependences in programs with dynamic data structures

Cited in

(3)

• Alias analysis in Java with reference-set representation for high-performance computing
• Unified analysis of array and object references in strongly typed languages
• Detecting loop-carried dependences in programs with dynamic data structures

This page was built for publication: Efficient dependence analysis for Java arrays

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