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

Fingerprint

Computer programming languages
Evaluation
Range of data
Compiler
Execution Time
Programming Languages
Assignment
Language

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

@article{f2d56d5d4bf640d59ef782cc3f9e5022,
title = "Eliminating redundant range checks in GNAT using symbolic evaluation",
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.",
author = "Johann Blieberger and Bernd Burgstaller",
year = "2003",
month = "12",
day = "1",
language = "English",
volume = "2655",
pages = "153--167",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Eliminating redundant range checks in GNAT using symbolic evaluation

AU - Blieberger, Johann

AU - Burgstaller, Bernd

PY - 2003/12/1

Y1 - 2003/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=35248895321&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35248895321&partnerID=8YFLogxK

M3 - Review article

AN - SCOPUS:35248895321

VL - 2655

SP - 153

EP - 167

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -