K John Gough, Herbert Klaeren  Home/Search
Context Related
| qut.edu.au/~gough/acsc19.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: qut.edu.au/CompSci...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We propose a new method of eliminating range checks in connection with array index expressions and assignments to variables of subrange types. Contrary to the approaches documented in the literature, we work on an extended static single assignment form (XSA) very near the target level. This gives significant advantages over previous attempts since many questions don't occur at all or else in a simpler form in the XSA. The technique has been implemented in a family of Modula-2 and Oberon-2... (Update)
Context of citations to this paper: More
...as its first argument. The detailed definition of the fi functions for all possible relational tests are given in the companion report [6]. The algorithm for XSA formation is now as follows; compare this to Algorithm 1: Algorithm 2 (Transform to XSA form) 1. Compute...
.... elimination techniques for redundant checks that are automatically introduced by type safe language systems such as array bounds checks [3] or dynamic type tests [1] obviously, all techniques used for this purpose are also suitable for elimination of redundant programmer...
Cited by: More
HOIST: A System for Automatically Deriving Static Analyzers.. - Regehr, Reid (2004) (Correct)
A New Type-Constructor for Modular Languages - Gough (1997) (Correct)
Executable Assertions and Separate Compilation - Gough, Klaeren (1997) (Correct)
Similar documents (at the sentence level):
68.4%: Eliminating Range Checks Using Static Single Assignment Form.. - Gough, Klaeren (1994) (Correct)
56.8%: Eliminating Range Checks Using Static Single Assignment Form - Gough, Klaeren (1994) (Correct)
Active bibliography (related documents): More All
0.2: Overview - The Gardens (Correct)
0.2: Optimal Code-Selection using MBURG - John Gough Jeff (Correct)
0.2: ABCD: Eliminating Array-Bounds Checks on Demand - Bodik, Gupta, Sarkar (2000) (Correct)
Similar documents based on text: More All
0.4: Implementing Languages Other than Java on the Java Virtual.. - Gough, Corney (Correct)
0.3: Concepts for Overloading and Subtyping in an Algebraic.. - Plümicke, Klaeren (1995) (Correct)
0.3: Merging Formal Methods With Rapid Prototyping - Klaeren, Thiemann (1995) (Correct)
Related documents from co-citation: More All
2: Single-pass generation of static single assignment form for structured languages - Brandis, Mossenbock - 1994
2: A fresh look at optimizing array bounds checking (context) - Gupta - 1990
2: Optimizing array bound checks using flow analysis - Gupta - 1993
BibTeX entry: (Update)
K.John Gough and Herbert Klaeren. Eliminating range checks using static single assignment form. Technical Report WSI-9413, Wilhelm Schickard Institut, Universitat Tubingen, Tubingen, Germany, 1994. http://citeseer.ist.psu.edu/article/gough94eliminating.html More
@misc{ john94eliminating,
author = "K. John and G. Herbert",
title = "Eliminating range checks using static single assignment form",
text = "K.John Gough and Herbert Klaeren. Eliminating range checks using static
single assignment form. Technical Report WSI-9413, Wilhelm Schickard Institut,
Universitat Tubingen, Tubingen, Germany, 1994.",
year = "1994",
url = "citeseer.ist.psu.edu/article/gough94eliminating.html" }
Citations (may not include all citations):415 Efficiently computing static single assignment form and the .. - Cytron, Ferrante et al. - 1991
232 Constant propagation with conditional branches (context) - Wegman, Kenneth - 1991
68 Beyond induction variables: Detecting and classifying sequen.. - Gerlek, Stoltz et al. - 1995
59 Compiler analysis of the value ranges for variables (context) - Harrison - 1977
50 Elimination of redundant array subscript range checks - Kolte, Wolfe - 1995
50 A fresh look at optimizing array bound checking (context) - Gupta - 1990
41 Implementation of array bound checker (context) - Suzuki, Ishihata - 1977
40 Optimizing array bound checks using flow analysis - Gupta - 1993
39 Accurate static branch prediction by value range propagation - Patterson - 1995
32 Optimization of range checking (context) - Markstein, Cocke et al. - 1982
24 Single-pass generation of static single assignment form for .. - Brandis, Mossenbock - 1994
17 Optimization of array subscript range checks (context) - Asuru - 1992
14 Software: Practice and Experience (context) - Welsh, checks - 1978
6 Type test elimination using typeflow analysis - Corney, John - 1994
4 Eliminating range checks using static single assignment form - John, Herbert - 1994
4 Register allocation in the gardens point compilers - John, Jeffrey - 1994
2 Information on gardens point compilers (context) - point, page et al.
Documents on the same site (http://www.fit.qut.edu.au/CompSci/PLAS/GPM/publications.html): More
Register Allocation in the Gardens Point Compilers - Gough, Ledermann (1994) (Correct)
Bottom up Tree Rewriting with MBURG: The MBURG Reference Manual - John Gough (Correct)
A Methodology for Decompilation - Cifuentes, Gough (1993) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC