Type-based analysis of uncaught exceptions

Leroy, Xavier; Pessaux, François

doi:10.1145/349214.349230

Cited by 66 publications

(35 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We, therefore, have to extend our type system with polyvariant recursion. While inferring polymorphic recursive types is undecidable in general (Kfoury et al 1993;Henglein 1993)-and, being an automatic analysis, we do not want to rely on any programmer-supplied annotations-earlier research (Tofte and Talpin 1994;Dussart et al 1995;Rittri 1995;Leroy and Pessaux 2000) has shown that this special case of polyvariant recursion is often both crucial to obtain adequate precision and feasible to infer automatically.…”

Section: Data Flowmentioning

confidence: 99%

“…Guzmán and Suárez (1994) and Fahndrich et al (1998) describe type-based exception analyses, neither are very precise. The row-based type system for exception analysis described in Leroy and Pessaux (2000) does containing a data-flow analysis component, although one that is specialized towards tracking value-carrying exceptions instead of valuedependent exceptions and thus employs a less precise unification method instead of subtyping. Glynn et al (2002) developed the first exception analysis for non-strict languages.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Type-based Exception Analysis for Non-strict Higher-order Functional Languages with Imprecise Exception Semantics

Koot

Hage

2015

Proceedings of the 2015 Workshop on Partial Evaluation and Program Manipulation

View full text Add to dashboard Cite

Most statically typed functional programming languages allow programmers to write partial functions: functions that are not defined on all the elements of their domain as specified by their type. Applying a partial function to a value on which it is not defined will raise a run-time exception, thus in practice well-typed programs can and do still go wrong.To warn programmers about such errors, contemporary compilers for functional languages employ a local and purely syntactic analysis to detect partial case-expressions-those that do not cover all possible patterns of constructors. As programs often maintain invariants on their data, restricting the potential values of the scrutinee to a subtype of its given or inferred type, many of these incomplete case-expressions are harmless. Such an analysis does not account for these invariants and will thus report many false positives, overwhelming the programmer.We develop a constraint-based type system that detects harmful sources of partiality and prove it correct with respect to an imprecise exception semantics. The analysis accurately tracks the flow of both exceptions-the manifestation of partiality gone wrong-and ordinary data through the program, as well as the dependencies between them. The latter is crucial for usable precision, but has been omitted from previously published exception analyses.

show abstract

Section: Data Flowmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Type-based Exception Analysis for Non-strict Higher-order Functional Languages with Imprecise Exception Semantics

Koot

Hage

2015

Proceedings of the 2015 Workshop on Partial Evaluation and Program Manipulation

View full text Add to dashboard Cite

show abstract

“…We use a Hindley/Milner type system inspired from that of ML, with added effects [13,26] and constraints [20]. In this section, we will first concentrate on the prevention of invalid parallelism, then introduce more constructs that are needed to avoid nested parallelism.…”

Section: Definition Of the Type Systemmentioning

confidence: 99%

Type system for a safe execution of parallel programs in BSML

Gava

Gesbert²,

Loulergue

2011

Proceedings of the Fifth International Workshop on High-Level Parallel Programming and Applications

View full text Add to dashboard Cite

BSML, or Bulk Synchronous Parallel ML, is a high-level language based on ML and dedicated to parallel computation. In this paper, an extended type system that guarantees the safety of parallel programs is presented. It prevents non-determinism and deadlocks by ensuring that the invariants needed to preserve the structured parallelism are verified. Imperative extensions (references, exceptions) are included, and the system is designed for compatibility with modules.

show abstract

“…The program Exception encodes the following exception analysis problem (of checking whether an uncaught exception may be raised), taken from [21]: let failwith msg = raise(Failure msg) let f x = if ... then ... else failwith ("f") let g x = try f x with Failure "f" -> 0 let main() = g() By representing exception handlers as alternative continuations as in [7], we get the following recursion scheme.…”

Section: Programsmentioning

confidence: 99%

Model-checking higher-order functions

Kobayashi

2009

Proceedings of the 11th ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

View full text Add to dashboard Cite

We propose a novel type-based model checking algorithm for higher-order recursion schemes. As shown by Kobayashi, verification problems of higher-order functional programs can easily be translated into model checking problems of recursion schemes. Thus, the model checking algorithm serves as a basis for verification of higher-order functional programs. To our knowledge, this is the first practical algorithm for model checking recursion schemes: all the previous algorithms always suffer from the n-EXPTIME bottleneck, not only in the worst case, and there was no implementation of the algorithms. We have implemented a model checker for recursion schemes based on the proposed algorithm, and applied it to verification of functional programs, including reachability, flow analysis and resource usage verification problems. According to our experiments, the model checker is surprisingly fast: it could automatically verify a number of small but tricky higherorder functional programs in less than a second.

show abstract

Type-based analysis of uncaught exceptions

Cited by 66 publications

References 41 publications

Type-based Exception Analysis for Non-strict Higher-order Functional Languages with Imprecise Exception Semantics

Type-based Exception Analysis for Non-strict Higher-order Functional Languages with Imprecise Exception Semantics

Type system for a safe execution of parallel programs in BSML

Model-checking higher-order functions

Contact Info

Product

Resources

About