Flow-Sensitive Type Qualifiers

Flow-Sensitive Type Qualifiers (2002)

by Jeffrey S. Foster , Tachio Terauchi , Alex Aiken

Citations:

User correction supplied by mph

Datum	Value	Source
TITLE	Flow-Sensitive Type Qualifiers	user correction - Legacy Corrections
AUTHOR NAME	Jeffrey S. Foster	user correction
AUTHOR AFFIL	Computer Science Division (EECS); University of California	user correction
AUTHOR ADDR	Berkeley, California 94720	user correction
AUTHOR NAME	Tachio Terauchi	user correction
AUTHOR AFFIL	Computer Science Division (EECS); University of California	user correction
AUTHOR ADDR	Berkeley, California 94720	user correction
AUTHOR NAME	Alex Aiken	user correction
AUTHOR AFFIL	Computer Science Division (EECS); University of California	user correction
AUTHOR ADDR	Berkeley, California 94720	user correction
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.	user correction - Legacy Corrections
YEAR	2002	user correction - Legacy Corrections
CITATIONS	20 found	ParsCit 1.0