Array bounds check elimination in the context of deoptimization

DOI10.1016/J.SCICO.2009.01.002zbMATH Open1183.68153OpenAlexW2067872619MaRDI QIDQ1016641FDOQ1016641

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

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

zbMATH Keywords

optimizationperformanceJavaarray bounds check eliminationjust-in-time compilation

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• Towards automatic binary runtime loop de-parallelization using on-stack replacement
• Title not available (Why is that?)
• Java heap protection for debugging native methods
• Title not available (Why is that?)

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)