Flow-sensitive type qualifiers

Jeffrey S. Foster*, Tachio Terauchi, Alex Aiken

*この研究の対応する著者

研究成果: Paper査読

254 被引用数 (Scopus)

抄録

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.

本文言語English
ページ1-12
ページ数12
DOI
出版ステータスPublished - 2002
外部発表はい
イベントProceedings of the ACM SIGPLAN 2002 Conference on Programming Language Design and Implementation (PLDI'02) - Berlin, Germany
継続期間: 2002 6 172002 6 19

Other

OtherProceedings of the ACM SIGPLAN 2002 Conference on Programming Language Design and Implementation (PLDI'02)
国/地域Germany
CityBerlin
Period02/6/1702/6/19

ASJC Scopus subject areas

  • ソフトウェア

フィンガープリント

「Flow-sensitive type qualifiers」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル