Type-based analysis of uncaught exceptions

Francois Pessaux; Xavier Leroy

doi:10.1145/292540.292565

Type-based analysis of uncaught exceptions

Francois Pessaux
, Xavier Leroy

INRIA Rocquencourt

Research output: Contribution to journal › Conference article › peer-review

Abstract

This paper presents a program analysis to estimate uncaught exceptions in ML programs. This analysis relies on unification-based type inference in a non-standard 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.

Original language	English
Pages (from-to)	276-290
Number of pages	15
Journal	Conference Record of the Annual ACM Symposium on Principles of Programming Languages
DOIs	https://doi.org/10.1145/292540.292565
Publication status	Published - 1 Jan 1999
Externally published	Yes
Event	The 1999 26th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, POPL'99 - San Antonio, TX, USA Duration: 20 Jan 1999 → 22 Jan 1999

Access to Document

10.1145/292540.292565

Cite this

@article{df4383ea1b334c57a8a040b3873e12ba,

title = "Type-based analysis of uncaught exceptions",

abstract = "This paper presents a program analysis to estimate uncaught exceptions in ML programs. This analysis relies on unification-based type inference in a non-standard 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.",

author = "Francois Pessaux and Xavier Leroy",

year = "1999",

month = jan,

day = "1",

doi = "10.1145/292540.292565",

language = "English",

pages = "276--290",

journal = "Conference Record of the Annual ACM Symposium on Principles of Programming Languages",

issn = "0730-8566",

note = "The 1999 26th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, POPL'99 ; Conference date: 20-01-1999 Through 22-01-1999",

}

TY - JOUR

T1 - Type-based analysis of uncaught exceptions

AU - Pessaux, Francois

AU - Leroy, Xavier

PY - 1999/1/1

Y1 - 1999/1/1

N2 - This paper presents a program analysis to estimate uncaught exceptions in ML programs. This analysis relies on unification-based type inference in a non-standard 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.

AB - This paper presents a program analysis to estimate uncaught exceptions in ML programs. This analysis relies on unification-based type inference in a non-standard 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.

UR - https://www.scopus.com/pages/publications/0032681510

U2 - 10.1145/292540.292565

DO - 10.1145/292540.292565

M3 - Conference article

AN - SCOPUS:0032681510

SN - 0730-8566

SP - 276

EP - 290

JO - Conference Record of the Annual ACM Symposium on Principles of Programming Languages

JF - Conference Record of the Annual ACM Symposium on Principles of Programming Languages

T2 - The 1999 26th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Language, POPL'99

Y2 - 20 January 1999 through 22 January 1999

ER -

Type-based analysis of uncaught exceptions

Abstract

Access to Document

Other files and links

Fingerprint

Cite this