(Enter summary)
Abstract: This paper presents a novel framework for the symbolic
bounds analysis of pointers, array indices, and accessed memory
regions. Our framework formulates each analysis problem
as a system of inequality constraints between symbolic
bound polynomials. It then reduces the constraint system
to a linear program. The solution to the linear program
provides symbolic lower and upper bounds for the values
of pointer and array index variables and for the regions of
memory that each statement and... (Update)
Cited by: More
Disassembly of Executable Code Revisited - Schwarz, Debray, Andrews (2002)
(Correct)
Similar documents (at the sentence level):
56.6%: Symbolic Bounds Analysis of Pointers, Array Indices, and.. - Rugina, Rinard (2000)
(Correct)
Active bibliography (related documents): More All
0.3: Design-Driven Compilation - Radu Rugina And (2001)
(Correct)
0.2: Analysis of Multithreaded Programs - Rinard (2001)
(Correct)
0.2: Data Size Optimizations for Java Programs - Ananian, Rinard (2003)
(Correct)
Similar documents based on text: More All
0.4: Automatic Parallelization of Divide and Conquer Algorithms - Rugina, Rinard (1999)
(Correct)
0.3: Pointer Analysis for Multithreaded Programs - Radu Rugina And (1999)
(Correct)
0.3: Recursion Unrolling for Divide and Conquer Programs - Rugina, Rinard
(Correct)
BibTeX entry: (Update)
R. Rugina and M. C. Rinard, "Symbolic Bounds Analysis of Pointers, Array Indices, and Accessed Memory Regions", Proc. SIGPLAN '00 Conference on Programming Language Design and Implementation, June 2000, pp. 182--195. http://citeseer.ist.psu.edu/article/rugina00symbolic.html More
@article{ rugina00symbolic,
author = "Radu Rugina and Martin Rinard",
title = "Symbolic bounds analysis of pointers, array indices, and accessed memory regions",
journal = "ACM SIG{\-}PLAN Notices",
volume = "35",
number = "5",
pages = "182--195",
year = "2000",
url = "citeseer.ist.psu.edu/article/rugina00symbolic.html" }
Citations (may not include all citations):
252
Analysis of pointers and structures (context) - Chase, Wegman et al. - 1990
200
Solving shapeanalysis problems in languages with destructive..
- Sagiv, Reps et al. - 1998
181
Principles of Program Analysis (context) - Nielson, Nielson et al. - 1999
149
An implementation of interprocedural bounded regular section..
- Havlak, Kennedy - 1991
146
Parallelizing programs with recursive data structures (context) - Hendren, Nicolau - 1990
141
Compaq Systems Research Center (context) - Detlefs, Leino et al. - 1998
132
Detecting conflicts between structure accesses (context) - Larus, Hilfinger - 1988
99
a shape analysis for heap-directed pointers in C (context) - Ghiya, Hendren et al. - 1996
81
The implementation of the Cilk-5 multithreaded language
- Frigo, Leiserson et al. - 1998
77
Type-based race detection for java
- Flanagan, Freund - 2000
67
ciently computing static single assignment form and the cont.. (context) - Cytron, Ferrante et al. - 1991
64
Interprocedural compilation of Fortran D for MIMD distribute..
- Hall, Hiranandani et al. - 1992
60
Recursion leads to automatic variable blocking for dense lin.. (context) - Gustavson - 1997
51
Pointer analysis for multithreaded programs
- Rugina, Rinard - 1999
50
Elimination of redundant array subscript range checks
- Kolte, Wolfe - 1995
46
An overview of a compiler for scalable parallel machines
- Amarasinghe, Anderson et al. - 1993
44
Bitwidth analysis with application to silicon compilation
- Stephenson, Babb et al. - 2000
43
ABCD: Eliminating array bounds checks on demand
- Bodik, Gupta et al. - 2000
42
Warlock: A static data race analysis tool (context) - Sterling - 1993
42
Auto-blocking matrixmultiplication or tracking BLAS3 perform..
- Frens, Wise - 1997
41
Detecting access anomalies in programs with critical section.. (context) - Dinning, Schonberg - 1991
39
Accurate static branch prediction by value range propagation
- Patterson - 1995
32
Optimization of range checking (context) - Markstein, Cocke et al. - 1982
32
Commutativity analysis: A new analysis technique for paralle..
- Rinard, Diniz - 1997
31
A first step towards automated detection of bu#er overrun vu.. (context) - Wagner, Foster et al. - 2000
27
Automatic parallelization of divide and conquer algorithms
- Rugina, Rinard - 1999
25
A technique for analyzing pointer and structure references i.. (context) - Guarna - 1988
23
Detecting data races in Cilk programs that use locks
- Cheng, Feng et al. - 1998
20
cient multithreaded runtime system (context) - Blumofe, Joerg et al. - 1996
20
BitValue inference: Detecting and exploiting narrow bitwidth..
- Budiu, Goldstein et al. - 2000
15
Automatic parallelization of recursive procedures
- Gupta, Mukhopadhyay et al. - 1999
13
Recursive array layouts and fast matrix multiplication
- Chatterjee, Lebeck et al. - 1999
11
Massachusetts Institute of Technology (context) - Ananian, single et al. - 1999
9
Available from httpflex compiler (context) - Silicon, for et al. - 1998
6
Commutativity analysis: A technique for automatically parall..
- Rinard, Diniz - 1996
2
ective automatic parallelization with Polaris (context) - Blume, Eigenmann et al. - 1995
Documents on the same site (http://www.cag.lcs.mit.edu/~rinard/paper/): More
Hierarchical Concurrency in Jade - Scales, Rinard, Lam, Anderson
(Correct)
Commutativity Analysis: A Technique for Automatically.. - Rinard, Diniz (1996)
(Correct)
Commutativity Analysis: A New Analysis Framework for.. - Rinard, Diniz (1996)
(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