Detecting loop-carried dependences in programs with dynamic data structures

DOI10.1016/J.JPDC.2006.08.007zbMATH Open1109.68039OpenAlexW1974708356MaRDI QIDQ868038FDOQ868038

Authors: Angeles Navarro, Francisco Corbera, Adrian Tineo, Rafael Asenjo, E. L. Zapata 

Publication date: 19 February 2007

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2006.08.007

Recommendations

• Data dependence analysis in programs with pointers
• scientific article; zbMATH DE number 1760024
• Compiler Construction
• scientific article; zbMATH DE number 1863277
• scientific article; zbMATH DE number 1940313

zbMATH Keywords

shape analysisabstract interpretationdynamic data structurescompiler optimizationsdata dependence test

Mathematics Subject Classification ID

Data structures (68P05) Theory of compilers and interpreters (68N20)

Cited In (4)

• Title not available (Why is that?)
• Identifying dynamic data structures by learning evolving patterns in memory
• Compiler Construction
• A New Algorithm for Identifying Loops in Decompilation

Uses Software

• ANTLR

This page was built for publication: Detecting loop-carried dependences in programs with dynamic data structures

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