Data Flow Analysis of Java Programs in the Presence of Exceptions

Authors:
Vladimir I. Shelekhov;Sergey V. Kuksenko
Affiliations:
-;-
Venue:
PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Year:
1999

Citing 5
Cited 1

Efficiently computing static single assignment form and the control dependence graph

ACM Transactions on Programming Languages and Systems (TOPLAS)
A safe approximate algorithm for interprocedural aliasing

PLDI '92 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
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
Complexity of Concrete Type-Inference in the Presence of Exceptions

ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
Towards a Cost-Effective Estimation of Uncaught Exceptions in SML Programs

SAS '97 Proceedings of the 4th International Symposium on Static Analysis

On the Practical Static Checker of Semantic Run-Time Errors

APSEC '99 Proceedings of the Sixth Asia Pacific Software Engineering Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

For data flow analysis of Java program to be correct and precise, the flows induced by exceptions must be properly analysed. In our data flow analysis, the implicit control flow for a raised exception is represented explicitly. Exception branches, exception plateaus, and exception exits for methods and method calls are introduced as additional control flow structures for analysis of exception handling. These structures are constructed dynamically under control of data flow analysis.