Partial redundancy elimination for access path expressions

DOI10.1002/spe.371zbMath1009.68882OpenAlexW2156800521MaRDI QIDQ4791060

David Whitlock, Quintin I. Cutts, Nathaniel Nystrom, Antony L. Hosking, 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 evaluationobject representationcode generationvirtual machinescache memoriesobject-oriented languagesincremental compilersrun-time environmentslanguage preprocessors

Mathematics Subject Classification ID

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

Cites Work

• Global optimization by suppression of partial redundancies
• Unnamed Item
• Unnamed Item
• Unnamed Item

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