Type-based analysis of uncaught exceptions

Abstract : This paper presents a program analysis to estimate un-caught 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [36 references]  Display  Hide  Download

https://hal.inria.fr/hal-01499959
Contributor : Xavier Leroy <>
Submitted on : Saturday, April 1, 2017 - 6:48:36 PM
Last modification on : Friday, May 25, 2018 - 12:02:03 PM
Long-term archiving on : Sunday, July 2, 2017 - 12:58:33 PM

File

exceptions-popl.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

François Pessaux, Xavier Leroy. Type-based analysis of uncaught exceptions. POPL 1999: 26th symposium Principles of Programming Languages, ACM, Jan 1999, San Antonio, United States. pp.276 - 290, ⟨10.1145/292540.292565⟩. ⟨hal-01499959⟩

Share

Metrics

Record views

214

Files downloads

128