Analysis of pointers and structures

Chase, David; Wegman, Mark N.; Zadeck, F. Kenneth

doi:10.1145/93542.93585

Cited by 299 publications

(123 citation statements)

References 0 publications

Supporting

Mentioning

123

Contrasting

Order By: Relevance

“…Such abstractions are useful e.g., for compile-time garbage collection, for program understanding, and for statically detecting errors such as null dereferencing. Both abstract domains proposed in this paper provide a form of shape analysis of the store (often called the heap) but are less expressive from this point of view than the proposals of e.g., [6,25,14]. Nevertheless, our proposal has other strong points:…”

Section: Pointer and Sharing Analysismentioning

confidence: 99%

“…Many authors have worked on abstracting data structures that are dynamically created and modified by programs (see, e.g., [6,13,14,24,25,27]). Such abstractions are useful e.g., for compile-time garbage collection, for program understanding, and for statically detecting errors such as null dereferencing.…”

Section: Pointer and Sharing Analysismentioning

confidence: 99%

“…2. The information provided by our domains is easier to understand than in e.g., [6,14,25,27] because the abstract store is homomorphic to the concrete one; therefore the domains are convenient for abstract debugging, for instance. 3.…”

Section: Pointer and Sharing Analysismentioning

confidence: 99%

“…3. Our domains are less expensive to implement because some of the information that is represented by shape graphs in e.g., [6,14,25] is replaced by an abstract type information. This is similar to the difference between the abstract domains Pattern [19] and Types [18] in logic programming.…”

Section: Pointer and Sharing Analysismentioning

confidence: 99%

“…They can be specialized by a suitable choice of these abstract descriptions to yield specific analysis. They basically integrate type analysis [1,5] and shape analysis [6,11,12,14,25].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Distinctness and Sharing Domains for Static Analysis of Java Programs

Pollet

Charlier

Cortesi

2001

ECOOP 2001 — Object-Oriented Programming

View full text Add to dashboard Cite

Abstract. The application field of static analysis techniques for objectoriented programming is getting broader, ranging from compiler optimizations to security issues. This leads to the need of methodologies that support reusability not only at the code level but also at higher (semantic) levels, in order to minimize the effort of proving correctness of the analyses. Abstract interpretation may be the most appropriate approach in that respect. This paper is a contribution towards the design of a general framework for abstract interpretation of Java programs. We introduce two generic abstract domains that express type, structural, and sharing information about dynamically created objects. These generic domains can be instantiated to get specific analyses either for optimization or verification issues. The semantics of the domains are precisely defined by means of concretization functions based on mappings between concrete and abstract locations. The main abstract operations, i.e., upper bound and assignment, are discussed. An application of the domains to source-to-source program specialization is sketched to illustrate the effectiveness of the analysis.

show abstract

Section: Pointer and Sharing Analysismentioning

confidence: 99%

Section: Pointer and Sharing Analysismentioning

confidence: 99%

Section: Pointer and Sharing Analysismentioning

confidence: 99%

Section: Pointer and Sharing Analysismentioning

confidence: 99%

“…They can be specialized by a suitable choice of these abstract descriptions to yield specific analysis. They basically integrate type analysis [1,5] and shape analysis [6,11,12,14,25].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Distinctness and Sharing Domains for Static Analysis of Java Programs

Pollet

Charlier

Cortesi

2001

ECOOP 2001 — Object-Oriented Programming

View full text Add to dashboard Cite

show abstract

Static slicing in Unix process environment

Goswami

Mall

Chatterjee

2000

Softw: Pract. Exper.

View full text Add to dashboard Cite

We present a method for computing static slices of concurrent programs in a Unix process environment. As a part of our methodology, we introduce the notion of a Concurrent Program Dependence Graph (CPDG). A CPDG represents various aspects of concurrent programs in a hierarchical fashion. This hierarchical representation lets us compute static slices of programs at different levels of abstraction. Based on our methodology, we have implemented a static slicing tool supporting an option to view slices of programs at different levels of details. Experience with our implementation shows that this approach helps the user get a better understanding of the behavior of concurrent programs.Design of the GUI for viewing the slice and specifying the slicing criterion for a concurrent/distributed program is much more complex than that for sequential programs. Due to the complex nature of large concurrent and distributed programs, it is necessary to make the slicing information as meaningful to

show abstract

alto: a link‐time optimizer for the Compaq Alpha

Muth¹,

Debray

Watterson

et al. 2001

Softw: Pract. Exper.

View full text Add to dashboard Cite

Traditional optimizing compilers are limited in the scope of their optimizations by the fact that only a single function, or possibly a single module, is available for analysis and optimization. In particular, this means that library routines cannot be optimized to specific calling contexts. Other optimization opportunities, exploiting information not available before link time, such as addresses of variables and the final code layout, are often ignored because linkers are traditionally unsophisticated. A possible solution is to carry out whole‐program optimization at link time. This paper describes alto, a link‐time optimizer for the Compaq Alpha architecture. It is able to realize significant performance improvements even for programs compiled with a good optimizing compiler with a high level of optimization. The resulting code is considerably faster than that obtained using the OM link‐time optimizer, even when the latter is used in conjunction with profile‐guided and inter‐file compile‐time optimizations. Copyright © 2001 John Wiley & Sons, Ltd.

show abstract

Analysis of pointers and structures

Cited by 299 publications

References 0 publications

Distinctness and Sharing Domains for Static Analysis of Java Programs

Distinctness and Sharing Domains for Static Analysis of Java Programs

Static slicing in Unix process environment

alto: a link‐time optimizer for the Compaq Alpha

Contact Info

Product

Resources

About