Flow-Sensitive Type Qualifiers

Abstract

We present a system for extending standard type systems with flow-sensitive type qualifiers. Users annotate their programs with type qualifiers, and inference checks that the annotations are correct. In our system only the type qualifiers are modeled flow-sensitively-the underlying standard types are unchanged, which allows us to obtain an efficient constraint-based inference algorithm that integrates flow-insensitive alias analysis, effect inference, and ideas from linear type systems to support strong updates. We demonstrate the usefulness of flow-sensitive type qualifiers by finding a number of new locking bugs in the Linux kernel.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 2001
Accession Number
ADA603588

Entities

People

  • Alex Aiken
  • Jeffrey S. Foster
  • Tachio Terauchi

Organizations

  • University of California, Berkeley

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Application Software
  • Automata
  • California
  • Computations
  • Computer Program Reliability
  • Computer Programming
  • Computer Science
  • Computers
  • Device Drivers
  • Language
  • Linearity
  • Machine Languages
  • Operating Systems
  • Programming Languages
  • Standards

Fields of Study

  • Computer science

Readers

  • Database Systems and Applications
  • Statistical inference.

Technology Areas

  • AI & ML