Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Pluggable checking and inferencing of nonnull types for Java

In English

Författare

Summary, in English

We have implemented a non-null type checker for Java and a new non-null inferencing algorithm for analyzing legacy code. The tools are modular extensions to the JastAdd extensible Java compiler, illustrating how pluggable type systems can be achieved. The resulting implementation is compact, less than 230 lines of code for the non-null checker and 460 for the inferencer. Non-null checking is a local analysis with little effect on compilation time. The inferencing algorithm is a whole-program analysis, yet it runs sufficiently fast for practical use, less than 10 seconds for 100.000 lines of code. We ran our inferencer on a large part of the JDK library, and could detect that around 70% of the dereferences, and around 24% of the method return values, were guaranteed to be non-null.

Publiceringsår

2007

Språk

Engelska

Sidor

455-475

Publikation/Tidskrift/Serie

Journal of Object Technology

Volym

6

Issue

9

Dokumenttyp

Artikel i tidskrift

Förlag

ETH, Zürich

Ämne

  • Computer Science

Status

Published

Forskningsgrupp

  • LUCAS

ISBN/ISSN/Övrigt

  • ISSN: 1660-1769