Java Bytecode Verification for @NonNull Types

No abstract is available for this paper.

• Publication year

  2008

• Venue

  International Conference on Compiler Construction

• Publication date

  2008-03-29

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/978-3-540-78791-4_16
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Amortised Memory Analysis Using the Depth of Data Structures

  2009cited by this paper
• Technical report, Victoria University of Wellington

  2008cited by this paper
• A Scalable Inclusion Constraint Solver Using Unification

  2008cited by this paper
• Efficient field-sensitive pointer analysis of C

  2007cited by this paper
• ECOOP 2007 - Object-Oriented Programming, 21st European Conference, Berlin, Germany, July 30 - August 3, 2007, Proceedings

  2007cited by this paper
• Non-null References by Default in Java: Alleviating the Nullity Annotation Burden

  2007cited by this paper
• Finding more null pointer bugs, but not too many

  2007cited by this paper
• Pluggable checking and inferencing of nonnull types for Java

  2007cited by this paper
• Inference of User-Defined Type Qualifiers and Qualifier Rules

  2006cited by this paper
• A framework for implementing pluggable type systems

  2006cited by this paper
• Towards Support for Non-null Types and Non-null-by-default in Java

  2006cited by this paper
• Context-Sensitive Points-to Analysis: Is It Worth It?

  2006cited by this paper
• Propagation of JML non-null annotations in Java programs

  2006cited by this paper
• A probabilistic language based upon sampling functions

  2005cited by this paper
• Semantic type qualifiers

  2005cited by this paper
• Evaluating and tuning a static analysis to find null pointer bugs

  2005cited by this paper
• Abstract Interpretation with Alien Expressions and Heap Structures

  2005cited by this paper
• Customization of Java Library Classes Using Type Constraints and Profile Information

  2004cited by this paper
• Efficient field-sensitive pointer analysis for C

  2004cited by this paper
• Online Cycle Detection and Difference Propagation: Applications to Pointer Analysis

  2004cited by this paper
• Pluggable Type Systems

  2004cited by this paper
• Analysis of Recursive Game Graphs Using Data Flow Equations

  2004cited by this paper
• Declaring and checking non-null types in an object-oriented language

  2003influential reference
• Java Bytecode Verification: Algorithms and Formalizations

  2003cited by this paper
• Flow-sensitive type qualifiers

  2002cited by this paper
• Extended static checking for Java

  2002cited by this paper
• A framework for optimizing Java using attributes

  2001cited by this paper
• Precise Constraint-Based Type Inference for Java

  2001cited by this paper
• ECOOP 2001 — Object-Oriented Programming

  2001cited by this paper
• Points-to analysis for Java using annotated constraints

  2001cited by this paper
• Polymorphic versus Monomorphic Flow-Insensitive Points-to Analysis for C

  2000cited by this paper
• Alias Types

  2000cited by this paper
• A theory of type qualifiers

  1999cited by this paper
• Introduction to Set Constraint-Based Program Analysis

  1999cited by this paper
• A specification of Java loading and bytecode verification

  1998cited by this paper
• Partial online cycle elimination in inclusion constraint graphs

  1998cited by this paper
• Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems

  1998cited by this paper
• The Java Virtual Machine Specification

  1996cited by this paper
• An Even Faster Solver for General Systems of Equations

  1996cited by this paper
• Sound polymorphic type inference for objects

  1995cited by this paper
• Beyond induction variables

  1995cited by this paper
• Precise concrete type inference for object-oriented languages

  1994cited by this paper
• Set-based analysis of ML programs

  1994cited by this paper
• Type inclusion constraints and type inference

  1993cited by this paper
• Efficient chaotic iteration strategies with widenings

  1993cited by this paper
• Construction of Thinned Gated Single-Assignment Form

  1993cited by this paper
• Type inference in the presence of overloading, subtyping and recursive types

  1992cited by this paper
• Solving systems of set constraints

  1992cited by this paper
• Making Type Inference Practical

  1992cited by this paper
• Object-oriented type inference

  1991cited by this paper
• Efficiently computing static single assignment form and the control dependence graph

  1991cited by this paper
• An efficient method of computing static single assignment form

  1989cited by this paper
• An efficient general iterative algorithm for dataflow analysis

  1987cited by this paper

• On Leveraging Tests to Infer Nullable Annotations

  2023cites this paper
• Language Design Meets Verifying Compilers (Keynote)

  2022cites this paper
• Relational nullable types with Boolean unification

  2021cites this paper
• Dependency Versioning in the Wild

  2019cites this paper
• On declarative rewriting for sound and complete union, intersection and negation types

  2019cites this paper
• Towards compilation of an imperative language for FPGAs

  2018cites this paper
• Rewriting for sound and complete union, intersection and negation types

  2017cites this paper
• Designing a verifying compiler: Lessons learned from developing Whiley

  2015cites this paper
• Sound and Complete Flow Typing with Unions, Intersections and Negations

  2013cites this paper
• Formal Techniques for Safety-Critical Systems

  2013cites this paper
• Reflections on Verifying Software with Whiley

  2013cites this paper
• A calculus for constraint-based flow typing

  2013cites this paper
• Whiley : a Language Combining Flow-Typing with Updateable Value Semantics

  2012cites this paper
• Nullness Analysis of Java Bytecode via Supercompilation over Abstract Values

  2012cites this paper
• Complete and Platform-Independent Calling Context Profiling for the Java Virtual Machine

  2011cites this paper
• Precise null-pointer analysis

  2011cites this paper
• Features of Annotations and their Applications

  2011cites this paper
• Formalisation and implementation of an algorithm for bytecode verification of @NonNull types

  2011cites this paper
• Freedom Before Commitment Simple Flexible Initialisation for Non-Null Types

  2011cites this paper
• Freedom before commitment: a lightweight type system for object initialisation

  2011cites this paper
• Implementing a Language with Flow-Sensitive and Structural Typing on the JVM

  2011cites this paper
• Structural and Flow-Sensitive Types for Whiley

  2010cites this paper
• A Featherweight Calculus for Flow-Sensitive Type Systems in Java

  2009influential citation
• Mocha: Type Inference for Java

  2009cites this paper
• Semantic Foundations and Inference of Non-null Annotations

  2008cites this paper
• A non-null annotation inferencer for Java bytecode

  2008cites this paper
• Mocha : Local Type Inference for Java

  2008cites this paper
• Nullness Analysis in Boolean Form

  2008cites this paper