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 xceptions (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.
Type de document :
Article dans une revue
ACM Transactions on Programming Languages and Systems (TOPLAS), ACM, 2000, 22 (2), pp.340-377. 〈10.1145/349214.349230〉
https://hal.inria.fr/hal-01499948
Contributeur : Xavier Leroy
<>
Soumis le : samedi 1 avril 2017 - 17:51:24
Dernière modification le : mardi 17 avril 2018 - 11:28:13
Document(s) archivé(s) le : dimanche 2 juillet 2017 - 12:45:04
Xavier Leroy, François Pessaux. Type-based analysis of uncaught exceptions. ACM Transactions on Programming Languages and Systems (TOPLAS), ACM, 2000, 22 (2), pp.340-377. 〈10.1145/349214.349230〉. 〈hal-01499948〉
