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.
| Original language | English |
|---|---|
| Pages (from-to) | 340-377 |
| Number of pages | 38 |
| Journal | ACM Transactions on Programming Languages and Systems |
| Volume | 22 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1 Jan 2000 |
| Externally published | Yes |
Keywords
- D.2.5 [Software Engineering]: Testing and Debugging - Error handling and recovery
- D.3.2 [Programming Languages]: Language Classifications - Applicative (functional) languages
- F.3.2 [Logics and Meanings of Programs]
- ML
- Symbolic execution
Fingerprint
Dive into the research topics of 'Type-based analysis of uncaught exceptions'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver