Partial redundancy elimination for access path expressions

DOI10.1002/SPE.371MaRDI QIDQ4791060zbMATH OpenOpenAlexFDO

Authors Antony L. Hosking, Nathaniel Nystrom, David Whitlock, Quintin I. Cutts, Amer Diwan

Publication date 4 February 2003

Published in Software: Practice and Experience (Search for Journal in Brave)

Full work available at URL https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=2430&context=cstech

zbMATH Keywords

optimizationperformance evaluationvirtual machinescode generationcache memoriesobject representationobject-oriented languagesincremental compilersrun-time environmentslanguage preprocessors

Mathematics Subject Classification ID

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

Recommendations

• Compiler Construction
• Languages and Compilers for Parallel Computing
• scientific article; zbMATH DE number 1617327
• scientific article; zbMATH DE number 2087577
• scientific article; zbMATH DE number 1863273

Cites work

• scientific article; zbMATH DE number 986407 (Why is no real title available?)
• scientific article; zbMATH DE number 711035 (Why is no real title available?)
• scientific article; zbMATH DE number 814824 (Why is no real title available?)
• Global optimization by suppression of partial redundancies

Cited in

(4)

• Compiler Construction
• scientific article; zbMATH DE number 1617322 (Why is no real title available?)
• Array bounds check elimination in the context of deoptimization
• Languages and Compilers for Parallel Computing

This page was built for publication: Partial redundancy elimination for access path expressions

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