Shape Analysis

Authors:
Reinhard Wilhelm;Shmuel Sagiv;Thomas W. Reps
Affiliations:
-;-;-
Venue:
CC '00 Proceedings of the 9th International Conference on Compiler Construction
Year:
2000

Citing 20
Cited 12

Detecting conflicts between structure accesses

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Dependence analysis for pointer variables

PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Analysis of pointers and structures

PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Pointer-induced aliasing: a problem classification

POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Parallelizing programs with recursive data structures

Parallelizing programs with recursive data structures
Abstractions for recursive pointer data structures: improving the analysis and transformation of imperative programs

PLDI '92 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
A lattice for abstract interpretation of dynamic (LISP-like) structures

Information and Computation
Interprocedural may-alias analysis for pointers: beyond k-limiting

PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Solving shape-analysis problems in languages with destructive updating

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Solving shape-analysis problems in languages with destructive updating

ACM Transactions on Programming Languages and Systems (TOPLAS)
Detecting memory errors via static pointer analysis (preliminary experience)

Proceedings of the 1998 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Parametric shape analysis via 3-valued logic

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Principles of Program Analysis

Principles of Program Analysis
A flexible approach to interprocedural data flow analysis and programs with recursive data structures

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Parallelizing Programs with Recursive Data Structures

IEEE Transactions on Parallel and Distributed Systems
Building a Bridge between Pointer Aliases and Program Dependences

ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
Analysis of Dynamic Structures for Efficient Parallel Execution

Proceedings of the 6th International Workshop on Languages and Compilers for Parallel Computing
Restructuring symbolic programs for concurrent execution on multiprocessors

Restructuring symbolic programs for concurrent execution on multiprocessors
Analysis of recursive types in an imperative language

Analysis of recursive types in an imperative language

Another Type System for In-Place Update

ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
Visualizing Memory Graphs

Revised Lectures on Software Visualization, International Seminar
Alias Analysis by Means of a Model Checker

CC '01 Proceedings of the 10th International Conference on Compiler Construction
Detecting Read-Only Methods in Java

LCR '00 Selected Papers from the 5th International Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers
Scalable Software Model Checking Using Design for Verification

Verified Software: Theories, Tools, Experiments
Kilim: Isolation-Typed Actors for Java

ECOOP '08 Proceedings of the 22nd European conference on Object-Oriented Programming
A novel analysis space for pointer analysis and its application for bug finding

Science of Computer Programming
Shape analysis with reference set relations

VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
An analysis of permutations in arrays

VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
A type system for reachability and acyclicity

ECOOP'05 Proceedings of the 19th European conference on Object-Oriented Programming
Algorithmic profiling

Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation
Reachability-based acyclicity analysis by Abstract Interpretation

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

A shape-analysis algorithm statically analyzes a program to determine information about the heap-allocated data structures that the program manipulates. The results can be used to understand or verify programs. They also contain information valuable for debugging, compile-time garbage collection, instruction scheduling, and parallelization.