A comprehensive approach to array bounds check elimination for Java

DOI10.1007/3-540-45937-5_23MaRDI QIDQ4738403zbMATH OpenFDO

Authors Feng Qian, Laurie Hendren, C. Verbrugge

Publication date 11 August 2004

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/2304/23040325.htm

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Computing methodologies and applications (68U99)

Recommendations

• Array bounds check elimination in the context of deoptimization
• Deriving pre-conditions for array bound check elimination
• Unified analysis of array and object references in strongly typed languages
• Comprehensive synchronization elimination for Java.
• A framework for optimizing Java using attributes

Cited in

(7)

• Array bounds check elimination in the context of deoptimization
• Checking array bounds by abstract interpretation and symbolic expressions
• Unified analysis of array and object references in strongly typed languages
• Eliminating redundant range checks in GNAT using symbolic evaluation
• Deriving pre-conditions for array bound check elimination
• Partial redundancy elimination for access path expressions
• Languages and Compilers for Parallel Computing

This page was built for publication: A comprehensive approach to array bounds check elimination for Java

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