Array bounds check elimination in the context of deoptimization

DOI10.1016/J.SCICO.2009.01.002MaRDI QIDQ1016641zbMATH OpenOpenAlexFDO

Authors Thomas Würthinger, Christian Wimmer, Hanspeter Mössenböck

Publication date 6 May 2009

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.scico.2009.01.002

zbMATH Keywords

optimizationperformanceJavaarray bounds check eliminationjust-in-time compilation

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Recommendations

• scientific article; zbMATH DE number 2087577
• scientific article; zbMATH DE number 1738288
• Partial redundancy elimination for access path expressions
• scientific article; zbMATH DE number 2087575
• Checking array bounds by abstract interpretation and symbolic expressions

Cited in

(4)

• scientific article; zbMATH DE number 1738288 (Why is no real title available?)
• Towards automatic binary runtime loop de-parallelization using on-stack replacement
• Java heap protection for debugging native methods
• scientific article; zbMATH DE number 2087577 (Why is no real title available?)

Describes a project that uses

Uses Software

• SciMark
• DaCapo
• SPECjvm98

This page was built for publication: Array bounds check elimination in the context of deoptimization

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