A non-null annotation inferencer for Java bytecode

Authors:
Laurent Hubert
Affiliations:
CNRS/IRISA, Rennes, France
Venue:
Proceedings of the 8th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Year:
2008

Citing 12
Cited 5

Control flow analysis in scheme

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Analysis of pointers and structures

PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Java virtual machine

Java virtual machine
Soot - a Java bytecode optimization framework

CASCON '99 Proceedings of the 1999 conference of the Centre for Advanced Studies on Collaborative research
Evaluating and tuning a static analysis to find null pointer bugs

PASTE '05 Proceedings of the 6th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Propagation of JML non-null annotations in Java programs

PPPJ '06 Proceedings of the 4th international symposium on Principles and practice of programming in Java
Finding more null pointer bugs, but not too many

PASTE '07 Proceedings of the 7th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Establishing object invariants with delayed types

Proceedings of the 22nd annual ACM SIGPLAN conference on Object-oriented programming systems and applications
Practical pluggable types for java

ISSTA '08 Proceedings of the 2008 international symposium on Software testing and analysis
Nullness Analysis in Boolean Form

SEFM '08 Proceedings of the 2008 Sixth IEEE International Conference on Software Engineering and Formal Methods
Java bytecode verification for @NonNull types

CC'08/ETAPS'08 Proceedings of the Joint European Conferences on Theory and Practice of Software 17th international conference on Compiler construction
Non-null references by default in java: alleviating the nullity annotation burden

ECOOP'07 Proceedings of the 21st European conference on Object-Oriented Programming

Soundly Handling Static Fields: Issues, Semantics and Analysis

Electronic Notes in Theoretical Computer Science (ENTCS)
Sawja: static analysis workshop for java

FoVeOOS'10 Proceedings of the 2010 international conference on Formal verification of object-oriented software
Formalisation and implementation of an algorithm for bytecode verification of @NonNull types

Science of Computer Programming
Freedom before commitment: a lightweight type system for object initialisation

Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
Experiences with PDG-Based IFC

ESSoS'10 Proceedings of the Second international conference on Engineering Secure Software and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a non-null annotations inferencer for the Java bytecode language. We previously proposed an analysis to infer non-null annotations and proved it soundness and completeness with respect to a state of the art type system. This paper proposes extensions to our former analysis in order to deal with the Java bytecode language. We have implemented both analyses and compared their behaviour on several benchmarks. The results show a substantial improvement in the precision and, despite being a whole-program analysis, production applications can be analyzed within minutes.