Elimination algorithms for data flow analysis
ACM Computing Surveys (CSUR)
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Algorithms
Programming in Mathematica
A practical algorithm for exact array dependence analysis
Communications of the ACM
The GNAT project: a GNU-Ada 9X compiler
TRI-Ada '94 Proceedings of the conference on TRI-Ada '94
Efficient program analysis using DJ graphs
Efficient program analysis using DJ graphs
Symbolic evaluation for parallelizing compilers
ICS '97 Proceedings of the 11th international conference on Supercomputing
A Practical Decision Procedure for Arithmetic with Function Symbols
Journal of the ACM (JACM)
Symbolic pointer analysis for detecting memory leaks
PEPM '00 Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Symbolic Cache Analysis for Real-Time Systems
Real-Time Systems - Special issue on worst-case execution-time analysis
Symbolic bounds analysis of pointers, array indices, and accessed memory regions
PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
Symbolic Analysis for Parallelizing Compilers
Symbolic Analysis for Parallelizing Compilers
Data-Flow Frameworks for Worst-Case Execution Time Analysis
Real-Time Systems
An Empirical Study of Fortran Programs for Parallelizing Compilers
IEEE Transactions on Parallel and Distributed Systems
Symbolic Reaching Definitions Analysis of Ada Programs
Ada-Europe '98 Proceedings of the 1998 Ada-Europe International Conference on Reliable Software Technologies
Simplifying Polynominal Constraints Over Integers to Make Dependence Analysis More Precise
CONPAR 94 - VAPP VI Proceedings of the Third Joint International Conference on Vector and Parallel Processing: Parallel Processing
Symbolic Evaluation and the Analysis of Programs
IEEE Transactions on Software Engineering
Symbolic analysis of imperative programming languages
JMLC'06 Proceedings of the 7th joint conference on Modular Programming Languages
A symbolic analysis framework for static analysis of imperative programming languages
Journal of Systems and Software
| Hi-index | 0.00 |
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.