Practical pluggable types for java

  • Authors:

  • Matthew M. Papi;Mahmood Ali;Telmo Luis Correa, Jr.;Jeff H. Perkins;Michael D. Ernst

  • Affiliations:

  • MIT Computer Science and Artificial Intelligence Lab, Cambridge, MA, USA;MIT Computer Science and Artificial Intelligence Lab, Cambridge, MA, USA;MIT Computer Science and Artificial Intelligence Lab, Cambridge, MA, USA;MIT Computer Science and Artificial Intelligence Lab, Cambridge, MA, USA;MIT Computer Science and Artificial Intelligence Lab, Cambridge, MA, USA

  • Venue:
  • ISSTA '08 Proceedings of the 2008 international symposium on Software testing and analysis
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper introduces the Checker Framework, which supports adding pluggable type systems to the Java language in a backward-compatible way. A type system designer defines type qualifiers and their semantics, and a compiler plug-in enforces the semantics. Programmers can write the type qualifiers in their programs and use the plug-in to detect or prevent errors. The Checker Framework is useful both to programmers who wish to write error-free code, and to type system designers who wish to evaluate and deploy their type systems. The Checker Framework includes new Java syntax for expressing type qualifiers; declarative and procedural mechanisms for writing type-checking rules; and support for flow-sensitive local type qualifier inference and for polymorphism over types and qualifiers. The Checker Framework is well-integrated with the Java language and toolset. We have evaluated the Checker Framework by writing 5 checkers and running them on over 600K lines of existing code. The checkers found real errors, then confirmed the absence of further errors in the fixed code. The case studies also shed light on the type systems themselves.