François Pessaux, Xavier Leroy  Home/Search
Context Related
| pauillac.inria.fr/...eptionspopl.ps.gz pauillac.inria.fr/...popl.letter.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cristal.inria.fr/~xleroy/ (more) From: cristal.inria.fr/~xleroy/ (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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. (Update)
Cited by: More
Statically-Scoped Exceptions: - Typed Foundation For (Correct)
Java Exceptions Throw no Surprises - Drossopoulou, Valkevych (2000) (Correct)
Statically-Scoped Exceptions: a Typed Foundation for.. - Krishnaswami, Aldrich (2004) (Correct)
Similar documents (at the sentence level):
58.5%: Type-Based Analysis of Uncaught Exceptions - Leroy, Pessaux (1998) (Correct)
Active bibliography (related documents): More All
0.3: Regaining Control of Exception Handling - Robillard, Murphy (1999) (Correct)
0.3: Interprocedural Exception Analysis for Java - Chang, Jo, Yi, Choe (2001) (Correct)
0.2: A Toolkit for Constructing Type- and Constraint-Based.. - Aiken, Fähndrich.. (1998) (Correct)
Similar documents based on text: More All
0.5: A Modular Module System - Leroy (2000) (Correct)
0.3: Compilation of Extended Recursion in Call-by-Value.. - Hirschowitz, Leroy.. (2003) (Correct)
0.3: A Reduction Semantics for Call-by-value Mixin Modules - Hirschowitz, Leroy, Wells (2003) (Correct)
Related documents from co-citation: More All
7: Exception analysis for Java - Yi, Chang - 1999
7: Towards a cost-effective estimation of uncaught exceptions in standard ml progra.. - Yi, Ryu - 1997
7: Program analysis using mixed term and set constraints - Fahndrich, Aiken - 1997
BibTeX entry: (Update)
X. Leroy and F. Pessaux. Type-based analysis of uncaught exceptions. Research report 3541, INRIA, Nov. 1998. Extended version of this paper. http://citeseer.ist.psu.edu/pessaux99typebased.html More
@inproceedings{ pessaux99typebased,
author = "Francois Pessaux and Xavier Leroy",
title = "Type-Based Analysis of Uncaught Exceptions",
booktitle = "Symposium on Principles of Programming Languages",
pages = "276-290",
year = "1999",
url = "citeseer.ist.psu.edu/pessaux99typebased.html" }
Citations (may not include all citations):306 A syntactic approach to type soundness - Wright, Felleisen - 1994
228 Points-to analysis in almost linear time - Steensgaard - 1996
188 Region-based memory management - Tofte, Talpin - 1997
176 Control-Flow Analysis of Higher-Order Languages (context) - Shivers - 1991
165 Set-based analysis of ML programs (context) - Heintze - 1994
126 Type inference with polymorphic recursion - Henglein - 1993
107 Complete type inference for simple objects (context) - Wand - 1987
99 Polymorphic effect systems (context) - Lucassen, Gifford - 1988
81 Refinement types for ML - Freeman, Pfenning - 1991
79 Polymorphic type schemes and recursive definitions (context) - Mycroft - 1984
67 Componential set-based analysis - Flanagan, Felleisen - 1997
65 A practical soft type system for Scheme - Wright, Cartwright - 1997
59 Smartest recompilation - Shao, Appel - 1993
58 Simple imperative polymorphism - Wright - 1995
57 Type inference for records in a natural extension of ML (context) - R'emy - 1993
54 Partial online cycle elimination in inclusion constraint gra.. - Fahndrich, Foster et al. - 1998
54 A polymorphic record calculus and its compilation - Ohori - 1995
54 Type reconstruction in the presence of polymorphic recursion (context) - Kfoury, Tiuryn et al. - 1993
48 Global tagging optimization by type inference - Henglein - 1992
41 The type and effect discipline - Talpin, Jouvelot - 1994
34 Type-based analysis of uncaught exceptions - Leroy, Pessaux - 1998
32 Unify and conquer (context) - Baker - 1990
28 Making set-constraint based program analyses scale (context) - Fahndrich, Aiken - 1996
24 Program analysis using mixed term and set constraints - Fahndrich, Aiken - 1997
21 Software and documentation available on the Web (context) - Leroy, Vouillon et al. - 1996
21 Objective ML: A simple object-oriented extension of ML - R'emy, Vouillon - 1997
15 Type inference in the presence of subtyping: from theory to .. (context) - Pottier - 1998
10 Polymorphic splitting: An effective polyvariant flow analysi.. - Jagannathan, Wright - 1998
9 An abstract interpretation for estimating uncaught exception.. (context) - Yi - 1998
9 Records and variants as a natural extension of ML (context) - R'emy - 1989
7 A region inference algorithm - Tofte, Birkedal - 1998
7 Syntactic theories and the algebra of record terms (context) - R'emy - 1993
6 Tracking down exceptions in Standard ML programs (context) - Fahndrich, Foster et al. - 1998
4 A type system for exceptions (context) - Guzm'an, Su'arez - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://cristal.inria.fr/~xleroy/): More
Security Properties of Typed Applets - Leroy, Rouaix (Correct)
Type-Based Analysis of Uncaught Exceptions - Leroy, Pessaux (1998) (Correct)
An overview of Types in Compilation - Leroy (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC