Flow-Sensitive Type Qualifiers (2002)
Cached
Download Links
- [HTTP.CS.Berkeley.EDU]
- [HTTP.CS.Berkeley.EDU]
- [www.cs.berkeley.edu]
- [www.cs.berkeley.edu]
- [www.cs.cmu.edu]
- [www-2.cs.cmu.edu]
- [theory.stanford.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 322 - 29 self |
BibTeX
@MISC{Foster02flow-sensitivetype,
author = {Jeffrey S. Foster and Tachio Terauchi and Alex Aiken},
title = {Flow-Sensitive Type Qualifiers},
year = {2002}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
