Java Bytecode Verification for @NonNull Types

Male, Chris; Pearce, David J.; Potanin, Alex; Dymnikov, Constantine

doi:10.1007/978-3-540-78791-4_16

Cited by 11 publications

(14 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some non-null type systems for the Java language have been proposed [6,15]. Although non-null annotations are not used by the compiler yet, this could likely change in the future, in which case it becomes crucial to prove the soundness of the logic underlying the type checker.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Semantic Foundations and Inference of Non-null Annotations

Hubert

Jensen

Pichardie

2008

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper proposes a semantics-based automatic null pointer analysis for inferring non-null annotations of fields in objectoriented programs. The analysis is formulated for a minimalistic OO language and is expressed as a constraint-based abstract interpretation of the program which for each field of a class infers whether the field is definitely non-null or possibly null after object initialization. The analysis is proved correct with respect to an operational semantics of the minimalistic OO language. This correctness proof has been machine checked using the Coq proof assistant. We also prove the analysis complete with respect to the non-null type system proposed by Fähndrich and Leino, in the sense that for every typable program the analysis is able to prove the absence of null dereferences without any hand-written annotations. Experiments with a prototype implementation of the analysis show that the inference is feasible for large programs.

show abstract

Section: Introductionmentioning

confidence: 99%

“…inferring nullness property for blocks of code from the guards. This is notably the case of FindBugs [11,10] and of the work by Male et al [15]. They rely on path-sensitive analysis and the treatment of field initialization is very weak.…”

Section: Introductionmentioning

confidence: 99%

Semantic Foundations and Inference of Non-null Annotations

Hubert

Jensen

Pichardie

2008

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…However, many solutions have been proposed (e.g. [37,38,39,40,41]), we find that Whiley's union types provide an elegant solution.…”

Section: Flowmentioning

confidence: 82%

Reflections on Verifying Software with Whiley

Pearce

Groves

2014

Communications in Computer and Information Science

Self Cite

View full text Add to dashboard Cite

An ongoing challenge for computer science is the development of a tool which automatically verifies programs meet their specifications, and are free from runtime errors such as divide-byzero, array out-of-bounds and null dereferences. Several impressive systems have been developed to this end, such as ESC/Java and Spec#, which build on existing programming languages (e.g. Java, C#). Unfortunately, such languages were not designed for this purpose and this significantly hinders the development of practical verification tools for them. For example, soundness of verification in these tools is compromised. We have developed a programming language specifically designed for verification, called Whiley, and an accompanying verifying compiler. In this paper, we reflect on a number of challenges we have encountered in developing a practical system.

show abstract

“…A non-null type system (e.g. [12][13][14][15]) prevents variables which may hold null from being dereferenced. The following illustrates:…”

Section: Flow Typingmentioning

confidence: 99%

“…Flow typing offers an alternative to Hindley-Milner type inference where a variable may have different types at different program points. The technique is adopted from flow-sensitive program analysis and has been used for non-null types [12][13][14][15], information flow [16][17][18], purity checking [19] and more [12,13,[20][21][22][23][24][25][26].…”

Section: Introductionmentioning

confidence: 99%

Sound and Complete Flow Typing with Unions, Intersections and Negations

Pearce

2013

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Flow typing is becoming a popular mechanism for typing existing programs written in untyped languages (e.g. JavaScript, Racket, Groovy). Such systems require intersections for the true-branch of a type test, negations for the false-branch, and unions to capture the flow of information at meet points. Type systems involving unions, intersections and negations require a subtype operator which is non-trivial to implement. Frisch et al. demonstrated that this problem was decidable. However, their proof was not constructive and does not lend itself naturally to an implementation. In this paper, we present a sound and complete algorithm for subtype testing in the presence of unions, intersections and negations.

show abstract

Java Bytecode Verification for @NonNull Types

Cited by 11 publications

References 30 publications

Semantic Foundations and Inference of Non-null Annotations

Semantic Foundations and Inference of Non-null Annotations

Reflections on Verifying Software with Whiley

Sound and Complete Flow Typing with Unions, Intersections and Negations

Contact Info

Product

Resources

About