F. Pessaux and X. Leroy. Type-based analysis of uncaught exceptions. ACM Transactions on Programming Languages and Systems, 22(2):340--377, 2000.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....their BANE toolkit to the analysis of uncaught exceptions in SML. Their system is based on equality constraints to keep track of exception values. Fessaux and Leroy desiged an exception analysis for OCaml based on type and e ect systems, and provides good performance for real OCaml programs [19]. Recently, several researchers have considered the e ects of exception related 17 constructs on various types of analyses. Choi and colleagues [4] describe a representation called the factored control ow graph (FCFG) to incorporate exceptional control ow, and use the representation to improve ....

F. Pessaux and X. Leroy, Type-based analysis of uncaught exceptions. Proceedings of 26th ACM Conference on Principles of Programming Languages, January 1999.

....described using a singleton filter, because it creates objects of a known class. The instanceof operator may be described using a cone filter, because it selects objects whose actual class is any subclass of a known class. Using this mechanism, uncaught exception analyses based on rows (see e.g. [8]) could be extended to handle languages where exceptions form a hierarchy, such as Java, while preserving their ability to analyze program modules in isolation. Naturally, this extension is speculative; its details remain to be worked out. 11 5.2 Structuring Individuals Let us say that a filter ....

Francois Pessaux and Xavier Leroy. Type-based analysis of uncaught exceptions. ACM Transactions on Programming Languages and Systems, 22(2):340-- 377, 2000. URL: http://pauillac.inria.fr/~xleroy/ publi/exceptions-toplas.ps.gz.

....manually. Those labels play a role similar to those of record label in ML or of method names in objects (for example) We borrow the row technology, used to type records, to approximate interfaces. Rows are now frequently used for static analysis in ML world (see for example, exception analysis [18] or object typing in Ocaml [20] In our context, a process type is a row, which is a partial function from labels to pair of types describing arguments the message contains. The rst one describes received messages content and the second handled messages content. Indeed, the originality of our ....

....of such applications needs a precise treatment of every possible exceptions. A type system helping the programmer in this task would be a real aid. It could estimate the set of potential exception caused by every expressions of the program and ensure that they are treated. An extension of [18] may be a good start point toward such a static analyzer. Finally, the most dicult point with Erlang is that the approximation made by this ideal type system should have to be compatible with hot code swapping. Indeed, in Erlang, a module is used by hundreds or thousands of nodes that cannot be ....

F. Pessaux and X. Leroy. Type-based analysis of uncaught exceptions. ACM Transactions on Programming Languages and Systems, 22(2):340-377, 2000.

....constraints, hence they must be made as compact as possible. In addition to standard structural subtyping, our system is also equipped with less common features. First, it provides rows, which increase the expressiveness of the language and are useful for handling type and e ect systems, see [3, 26]. Second, we deal with an original form of constraints, referred to as weak inequalities, which allow handling constraints such as guards [5] for further information, see section 3.3) One may also mention that invariant arguments for type constructors are supported. Although these may be ....

Pessaux, F., Leroy, X.: Type-based analysis of uncaught exceptions. ACM Transactions on Programming Languages and Systems 22 (2000) 340-377 url: http://pauillac.inria.fr/~xleroy/publi/exceptions-toplas.ps.gz.

....constraints, hence they must be made as compact as possible. In addition to standard structural subtyping, our system is also equipped with less common features. First, it provides rows, which increase the expressiveness of the language and are useful for handling type and e ect systems, see [3, 26]. Second, we deal with an original form of constraints, referred to as weak inequalities, which allow handling constraints such as guards [5] for further information, see section 3.3) One may also mention that invariant arguments for type constructors are supported. Although these may be ....

Pessaux, F., Leroy, X.: Type-based analysis of uncaught exceptions. ACM Transactions on Programming Languages and Systems 22 (2000) 340-377

....x [ r] search l i r) TypeCheck = fun l1 :vml arg l 1 : ln:vml arg l n vml valu = vml V .valu l1:vml arg l 1 : ln:vml arg l n [ valof M ] M ] valu Fig. 5. Translation of VMabl into OCaml with Labeled Arguments and Polymorphic Variants uncaught exceptions [15, 30, 31], can perhaps be adapted for views, for example to analyze the flow of view constructors and check the exhaustiveness (or redundancy) of pattern matching. Views for Abstract Data Types. Originally, hypothetical views had nothing to do with views for abstract data types [28] Taking a hindsight, ....

Xavier Leroy and Francois Pessaux. Type-based analysis of uncaught exceptions. ACM Transactions on Programming Languages and Systems, 22(2):340--377, 2000. An extended abstract appeared in Proceedings of the 26th ACM SIGPLANSIGACT Symposium on Principles of Programming Languages, 1999, pages 276-- 290.

....in OCaml, exception definitions require explicit type annotations. However, views are different from ML like exceptions in that a view has its own value part in addition to the representation part. Nevertheless, techniques developed for exceptions, such as static detection of uncaught exceptions [17, 37 40], can perhaps be adapted for views, for example to analyze the flow of view constructors and check the exhaustiveness (or redundancy) of pattern matching. Views for Abstract Data Types. Originally, hypothetical views had nothing to do with views for abstract data types [35] Taking a hindsight, ....

Xavier Leroy and Francois Pessaux. Type-based analysis of uncaught exceptions. ACM Transactions on Programming Languages and Systems, 22(2):340--377, 2000.

....Any kind of observable side effect can be analyzed by using the effect system. The original effect system [LG88, JG91, TJ92] used it to trace the memory operations, which is adopted to our work. Tofte and Talpin [TT94] used effect system for the stack allocation of all data. Xavier and Pessaux [PL99] used effect system for the analysis of uncaught exceptions. 8 3. Our approach Our langauge, etySECK, is an intermediate language which has type and effect annotations in the code part. The etySECK is a stack based abstract machine whose semantics is descrbied as a set of transition rules. This ....

Francois Pessaux and Xavier Leroy. Type-based analysis of uncaught exceptions. In Proceedings of The ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 276--290, January 1999.

....and computing the constraints least solution uses the fixpoint iteration of cubic complexity because the set domain is finite and the set operators [ and X g Gamma fc 1 g are monotonic. 6 Related Work Several exception analyses have been developed to detect uncaught exceptions in ML programs [Yi94, YR97, YR01, LP00]. Yi first designed an exception analysis for Standard ML (SML) programs based on abstract interpretation [Yi94] which was very accurate but too slow. Yi and Ryu redesigned the analysis by set based framework [YR97, YR01] which shows a good cost accuracy performance. Fahndrich and Aiken [FFAC98] ....

....framework [YR97, YR01] which shows a good cost accuracy performance. Fahndrich and Aiken [FFAC98] developed an exception analyzer for SML programs by using their BANE (Berkeley ANalysis Engine) toolkit. As in effect systems, their system casts the type and exception inference. Leroy and Pessaux [LP00] developed an exception analysis for OCaml programs which relies on a unification based type inference in a non standard type system. Their type system uses unified mechanisms both to collect the sets of uncaught exceptions of expressions and to refine the usual ML types by more precise ....

Xavier Leroy and Francois Pessaux. Type-based analysis of uncaught exceptions. ACM Transactions on Programming Languages and Systems, 22(2):340--377, March 2000.

....Uncaught exceptions are sometimes disastrous [Ar996] Second, even though there is no escaping exception from the program, the dynamic nature of abnormal situations makes it difficult to assure that every raised exception will be correctly handled. There already exist practical tools [YR97, YRon, PL99, YR98, YC99] to the first problem but, as far as we know, the second problem of assuring exception s correct handling is not yet addressed. Our proposed solution to the second problem is a static analysis that automatically generates test data that will execute all the exception raise ....

Francois Pessaux and Xavier Leroy. Type-based analysis of uncaught exceptions. In ACM Symposium on Principles of Programming Languages, pages 276--290, January 1999.

....from the causality analysis can be used for type directed optimization of this code. Acknowledgements We are grateful to Michel Mauny and Didier R emy for their help with early versions of this article. Fran cois Pessaux had used a type system with rows to statically detect uncaught exceptions[12], and his explanations were very bene cial. We would also like to thank the referees for their constructive suggestions. ....

F. Pessaux and X. Leroy. Type-based analysis of uncaught exceptions. ACM Trans. Prog. Lang. Syst., 22(2):340-377, 2000.

....program #, let # # # : C. Then, if m # # e : C # occurs during # # # : C then lm(C) Xm ) includes all the exceptions that escape from e during the execution of #. Proof. In [15] # 5. Related Work Several exception analyses have been developed to detect uncaught exceptions in ML programs [17, 19, 20, 12]. Yi first designed an exception analysis for Standard ML (SML) programs based on abstract interpretation [17] which was very accurate but too slow. Yi and Ryu redesigned the analysis by set based framework [19, 20] which shows a good cost accuracy performance. F ahndrich and Aiken [7] developed ....

....set based framework [19, 20] which shows a good cost accuracy performance. F ahndrich and Aiken [7] developed an exception analyzer for SML programs by using their BANE (Berkeley ANalysis Engine) toolkit. As in effect systems, their system casts the type and exception inference. Leroy and Pessaux [12] developed an exception analysis for OCaml programs which relies on a unification based type inference in a non standard type system. Their type system uses unified mechanisms both to collect the sets of uncaught exceptions of expressions and to refine the usual ML types by more precise ....

X. Leroy and F. Pessaux. Type-based analysis of uncaught exceptions. ACM Transactions on Programming Languages and Systems, 22(2):340--377, Mar. 2000.

....The basic idea is to extend the type annotation for a function with an e ect that may occur during the application of this function. For every expression a type and the e ect of its reduction can be approximated. Type and e ect systems provide for powerful analyses like exception analysis [26], side e ect analysis [22] or communication analysis [23, 24] Since nondeterminism is mostly caused by uninstantiated variables in arguments of exible functions, we use a nonstandard type system to distinguish between ground terms and any terms. Thus, we de ne type expressions as follows: G ....

F. Pessaux and X. Leroy. Type-based analysis of uncaught exceptions. In Proc. of POPL'99, pages 276-290. ACM Press, 1999.

....which is indexed by E n f g. We write a 2 r to indicate that a is a member of r s codomain. Our types are those of ML s type system, decorated with extra annotations of two kinds. First, we employ rows to keep track of exceptions, as in existing type and e ect systems, such as Pessaux and Leroy s [13]. If an exception value has type r exn , then the row r contains information about the exception s name. Speci cally, for every 2 E, if r( is Abs, then the exception s name cannot be ; if, on the other hand, it is Pre , then the exception may be named . Furthermore, function types ....

Francois Pessaux and Xavier Leroy. Type-based analysis of uncaught exceptions. ACM Transactions on Programming Languages and Systems, 22(2):340{ 377, 2000. URL: http://pauillac.inria.fr/~xleroy/publi/ exceptions-toplas.ps.gz.

No context found.

F. Pessaux and X. Leroy. Type-based analysis of uncaught exceptions. ACM Transactions on Programming Languages and Systems, 22(2):340--377, 2000.

No context found.

Francois Pessaux and Xavier Leroy. Type-based analysis of uncaught exceptions. In Proceedings of 26th ACM Conference on Principles of Programming Languages, January 1999.

No context found.

F. Pessaux and X. Leroy. Type-based analysis of uncaught exceptions. ACM Transactions on Programming Languages and Systems, 22(2):340--377, 2000.

No context found.

F. Pessaux and X. Leroy. Type-based analysis of uncaught exceptions. ACM Transactions on Programming Languages and Systems, 22(2):340--377, 2000.

No context found.

Xavier Leroy and Francois Pessaux. Type-based analysis of uncaught exceptions. ACM Transactions on Programming Languages and Systems, 22(2):340-377, 2000. An extended abstract appeared in Proceedings of the 26th ACM SIGPLANSIGACT Symposium on Principles of Programming Languages, 1999, pages 276{ 290.

No context found.

F. Pessaux and X. Leroy. Type-based analysis of uncaught exceptions. In Proceedings of ACM SIGPLAN /SIGACT Symposium on Principles of Programming Languages, pages 276--290, 1999.

No context found.

Xavier Leroy and Francois Pessaux. Type-based analysis of uncaught exceptions. ACM Transactions on Programming Languages and Systems, 22(2):340--377, March 2000.

No context found.

Pessaux, F., Leroy, X.: Type-based analysis of uncaught exceptions. ACM Transactions on Programming Languages and Systems 22 (2000)

No context found.

Francois Pessaux and Xavier Leroy. Type-based analysis of uncaught exceptions. ACM Transactions on Programming Languages and Systems, 22(2):340--377, 2000. url: http://pauillac.inria.fr/~xleroy/publi/ exceptions-toplas.ps.gz.

No context found.

F. Pessaux and X. Leroy. Type-based analysis of uncaught exceptions. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages, pages 276--290, 1999. 34

No context found.

F. Pessaux and X. Leroy. Type-based analysis of uncaught exceptions. In Proc Principles of Programming Languages (POPL'99), San Antonio, Jan 1999.

First 50 documents

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