Type-based analysis of uncaught exceptions

1 March 2000

journal article
Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems

Vol. 22 (2) , 340-377
https://doi.org/10.1145/349214.349230

Abstract

This article presents a program analysis to estimate uncaught exceptions in ML programs. This analysis relies on unification-based type inference in a nonstandard type system, using rows to approximate both the flow of escaping exceptions (a la effect systems) and the flow of result values (a la control-flow analyses). The resulting analysis is efficient and precise; in particular, arguments carried by exceptions are accurately handled.

Keywords

This publication has 25 references indexed in Scilit:

A region inference algorithm
ACM Transactions on Programming Languages and Systems, 1998
An abstract interpretation for estimating uncaught exceptions in Standard ML programs
Science of Computer Programming, 1998
An extended static checker for modula-3
Published by Springer Nature ,1998
Polymorphic splitting
ACM Transactions on Programming Languages and Systems, 1998
Program analysis using mixed term and set constraints
Published by Springer Nature ,1997
Towards a cost-effective estimation of uncaught exceptions in SML programs
Published by Springer Nature ,1997
A practical soft type system for scheme
ACM Transactions on Programming Languages and Systems, 1997
Program verification through soft typing
ACM Computing Surveys, 1996
Simple imperative polymorphism
Higher-Order and Symbolic Computation, 1995
A polymorphic record calculus and its compilation
ACM Transactions on Programming Languages and Systems, 1995