Towards a cost-effective estimation of uncaught exceptions in SML programs

Yi, Kwangkeun; Ryu, Sukyoung

doi:10.1007/bfb0032736

Cited by 18 publications

(21 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our choice of the terms constructor and destructor is inspired by work on detecting uncaught exceptions in functional programs [18,17] and soft typing [4,1]. A core issue in both bodies of work is tracking which datatype constructors a program value may actually have at run-time.…”

Section: Related Workmentioning

confidence: 99%

Static error detection using semantic inconsistency inference

Dillig

Aiken

2007

Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation

View full text Add to dashboard Cite

Inconsistency checking is a method for detecting software errors that relies only on examining multiple uses of a value. We propose that inconsistency inference is best understood as a variant of the older and better understood problem of type inference. Using this insight, we describe a precise and formal framework for discovering inconsistency errors. Unlike previous approaches to the problem, our technique for finding inconsistency errors is purely semantic and can deal with complex aliasing and path-sensitive conditions. We have built a null dereference analysis of C programs based on semantic inconsistency inference and have used it to find hundreds of previously unknown null dereference errors in widely used C programs.

show abstract

Section: Related Workmentioning

confidence: 99%

Static error detection using semantic inconsistency inference

Dillig

Aiken

2007

Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation

View full text Add to dashboard Cite

show abstract

“…Robillard and G.C. Murphy Yi and Ryu [1997] developed a more efficient one using control-flow analysis and a set-constraints framework [Heintze 1992].…”

Section: Related Workmentioning

confidence: 99%

Static analysis to support the evolution of exception structure in object-oriented systems

Robillard

Murphy

2003

ACM Trans. Softw. Eng. Methodol.

137

112

View full text Add to dashboard Cite

Exception-handling mechanisms in modern programming languages provide a means to help software developers build robust applications by separating the normal control flow of a program from the control flow of the program under exceptional situations. Separating the exceptional structure from the code associated with normal operations bears some consequences. One consequence is that developers wishing to improve the robustness of a program must figure out which exceptions, if any, can flow to a point in the program. Unfortunately, in large programs, this exceptional control flow can be difficult, if not impossible, to determine.In this article, we present a model that encapsulates the minimal concepts necessary for a developer to determine exception flow for object-oriented languages that define exceptions as objects. Using these concepts, we describe why exception-flow information is needed to build and evolve robust programs. We then describe Jex, a static analysis tool we have developed to provide exception-flow information for Java systems based on this model. The Jex tool provides a view of the actual exception types that might arise at different program points and of the handlers that are present. Use of this tool on a collection of Java library and application source code demonstrates that the approach can be helpful to support both local and global improvements to the exception-handling structure of a system.

show abstract

“…Many exception flow analyses augment the type system of the underlying programming language with information about the exceptions that can be thrown by a particular language construct [9,10,11,12,13,14,15,16]. The analyses differ in their representation of the inferred exception clauses, and the speed and precision of the analysis, but the principle is always the same.…”

Section: Related Workmentioning

confidence: 99%

Modular type checking of anchored exception declarations

Dooren

Jacobs

Joosen

2014

Science of Computer Programming

View full text Add to dashboard Cite

Checked exceptions improve the robustness of software, but they also decrease its adaptability because they must be propagated explicitly, and because they must often be handled even if they cannot be thrown. Anchored exception declarations solve both problems by allowing a method to declare its exceptional behavior in terms of other methods.The original type checking analyses for anchored exception declarations, however, are not modular. In this paper, we present algorithms for modular verification of soundness in an object-oriented language without parametric polymorphism.

show abstract

Towards a cost-effective estimation of uncaught exceptions in SML programs

Cited by 18 publications

References 9 publications

Static error detection using semantic inconsistency inference

Static error detection using semantic inconsistency inference

Static analysis to support the evolution of exception structure in object-oriented systems

Modular type checking of anchored exception declarations

Contact Info

Product

Resources

About