Eliminating redundant range checks in GNAT using symbolic evaluation

Johann Blieberger, Bernd Burgstaller

Research output: Contribution to journalReview article

2 Citations (Scopus)

Abstract

Implementation of a strongly typed language such as Ada95 requires range checks in the presence of array index expressions and assignment statements. Range checks that cannot be eliminated by the compiler must be executed at run-time, inducing execution time and code size overhead. In this work we propose a new approach for eliminating range checks that is based on symbolic evaluation. Type information provided by the underlying programming language is heavily exploited.

Original languageEnglish
Pages (from-to)153-167
Number of pages15
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2655
Publication statusPublished - 2003 Dec 1

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Eliminating redundant range checks in GNAT using symbolic evaluation'. Together they form a unique fingerprint.

  • Cite this