Current JDK Java compiler relies too much on programmer's speciication for checking against uncaught exceptions of the input program. It is not elaborate enough to remove programmer's unnecessary handlers (when programmer's speciications are too many) nor suggest to programmers for specialized handlings (when programmer's speciica-tions are too general). We propose a static analysis of Java programs that estimates their exception ows independently of the programmer's speciications. This analysis is an extension of a class analysis to Java's exception mechanism. Its cost-eeectiveness balance is suggested by sparsely analyzing the program at method-level (hence reducing the number of unknowns in the ow equations).
[1]
Patrick Cousot,et al.
Compositional and Inductive Semantic Definitions in Fixpoint, Equational, Constraint, Closure-condition, Rule-based and Game-Theoretic Form
,
1995,
CAV.
[2]
David Grove,et al.
Vortex: an optimizing compiler for object-oriented languages
,
1996,
OOPSLA '96.
[3]
Kwangkeun Yi,et al.
Towards a Cost-Effective Estimation of Uncaught Exceptions in SML Programs
,
1997,
SAS.
[4]
David Grove,et al.
Fast interprocedural class analysis
,
1998,
POPL '98.
[5]
Nevin Charles Heintze,et al.
Set based program analysis
,
1992
.