Granularity of constraint-based analysis for Java

Authors:
Byeong-Mo Chang;Jangwu Jo
Affiliations:
Sookmyung Women's University, Yongsan-ku, Seoul, Korea;Pusan University of Foreign Studies, Pusan, Korea
Venue:
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Year:
2001

Citing 17
Cited 0

Abstract interpretation and application to logic programs

Journal of Logic Programming
Set based program analysis

Set based program analysis
Set-based analysis of ML programs

LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
Formal language, grammar and set-constraint-based program analysis by abstract interpretation

FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Fast static analysis of C++ virtual function calls

Proceedings of the 11th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Componential set-based analysis

Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
Javalight is type-safe—definitely

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Fast interprocedural class analysis

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Partial online cycle elimination in inclusion constraint graphs

PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Projection merging: reducing redundancies in inclusion constraint graphs

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type-based race detection for Java

PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
Scalable propagation-based call graph construction algorithms

OOPSLA '00 Proceedings of the 15th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Interprocedural exception analysis for Java

Proceedings of the 2001 ACM symposium on Applied computing
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
Exception Analysis for Java

Proceedings of the Workshop on Object-Oriented Technology
Reducing the Cost of Data Flow Analysis By Congruence Partitioning

CC '94 Proceedings of the 5th International Conference on Compiler Construction

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a transformation-based approach to design constraint-based analyses for Java at a coarser granularity. In this approach, we design a less or equally precise but more efficient version of an original analysis by transforming the original construction rules into new ones. As applications of this rule transformation, we provide two instances of analysis design by rule-transformation. The first one designs a sparse version of class analysis for Java and the second one deals with a sparse exception analysis for Java. Both are designed based on method-level, and the sparse exception analysis is shown to give the same information for every method as the original analysis.