Article

Interprocedural Array Redistribution Data-Flow Analysis

Authors:

Daniel J. Palermo,

Eugene W. Hodges, IV,

Prithviraj BanerjeeAuthors Info & Claims

LCPC '96: Proceedings of the 9th International Workshop on Languages and Compilers for Parallel Computing

Pages 435 - 449

Published: 08 August 1996 Publication History

Abstract

No abstract available.

Cited By

View all

Knoop JMehofer E(2002)Distribution Assignment PlacementIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2002.101141613:6(628-647)Online publication date: 1-Jun-2002
https://dl.acm.org/doi/10.1109/TPDS.2002.1011416
Palermo DHodges EBanerjee P(2001)Compiler optimization of dynamic data distributions for distributed-memory multicomputersCompiler optimizations for scalable parallel systems10.5555/380466.380479(445-484)Online publication date: 1-Jun-2001
https://dl.acm.org/doi/10.5555/380466.380479
Benkner S(1999)VFC: The Vienna Fortran CompilerScientific Programming10.1155/1999/3046397:1(67-81)Online publication date: 1-Jan-1999
https://dl.acm.org/doi/10.1155/1999/304639
Show More Cited By

Recommendations

Interprocedural array data-flow analysis
Interprocedural pointer alias analysis

We present practical approximation methods for computing and representing interprocedural aliases for a program written in a language that includes pointers, reference parameters, and recursion. We present the following contributions: (1) a framework ...
Interprocedural data flow analysis in Soot using value contexts
SOAP '13: Proceedings of the 2nd ACM SIGPLAN International Workshop on State Of the Art in Java Program analysis

An interprocedural analysis is precise if it is flow sensitive and fully context-sensitive even in the presence of recursion. Many methods of interprocedural analysis sacrifice precision for scalability while some are precise but limited to only a ...

Comments

Information & Contributors

Information

Published In

LCPC '96: Proceedings of the 9th International Workshop on Languages and Compilers for Parallel Computing

August 1996

610 pages

ISBN:3540630910

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 08 August 1996

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Knoop JMehofer E(2002)Distribution Assignment PlacementIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2002.101141613:6(628-647)Online publication date: 1-Jun-2002
https://dl.acm.org/doi/10.1109/TPDS.2002.1011416
Palermo DHodges EBanerjee P(2001)Compiler optimization of dynamic data distributions for distributed-memory multicomputersCompiler optimizations for scalable parallel systems10.5555/380466.380479(445-484)Online publication date: 1-Jun-2001
https://dl.acm.org/doi/10.5555/380466.380479
Benkner S(1999)VFC: The Vienna Fortran CompilerScientific Programming10.1155/1999/3046397:1(67-81)Online publication date: 1-Jan-1999
https://dl.acm.org/doi/10.1155/1999/304639
Kennedy KKremer U(1998)Automatic data layout for distributed-memory machinesACM Transactions on Programming Languages and Systems10.1145/291891.29190120:4(869-916)Online publication date: 1-Jul-1998
https://dl.acm.org/doi/10.1145/291891.291901
Coelho F(1997)Compiling dynamic mappings with array copiesACM SIGPLAN Notices10.1145/263767.26378632:7(168-179)Online publication date: 21-Jun-1997
https://dl.acm.org/doi/10.1145/263767.263786
Coelho FSchreiber RPingali K(1997)Compiling dynamic mappings with array copiesProceedings of the sixth ACM SIGPLAN symposium on Principles and practice of parallel programming10.1145/263764.263786(168-179)Online publication date: 21-Jun-1997
https://dl.acm.org/doi/10.1145/263764.263786

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Recommendations

Interprocedural array data-flow analysis

Interprocedural pointer alias analysis

Interprocedural data flow analysis in Soot using value contexts

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations