Flow-Insensitive Type Qualifiers 1 (2009)
Jeffrey S. Foster, Robert Johnson, John Kodumal, Alex Aiken
We describe flow-insensitive type qualifiers, a lightweight, practical mechanism for specifying and checking properties not captured by traditional type systems. We present a framework for adding...
Flow-Insensitive Type Qualifiers 1 (2008)
Jeffrey S. Foster, Robert Johnson, John Kodumal, Alex Aiken
We describe flow-insensitive type qualifiers, a lightweight, practical mechanism for specifying and checking properties not captured by traditional type systems. We present a framework for adding...
Program Analysis with Regularly Annotated Constraints (2006)
Copyright c ○ 2006 by
Banshee: A scalable constraint-based analysis toolkit (2005)
Abstract. We introduce Banshee, a toolkit for constructing constraintbased analyses. Banshee’s novel features include a code generator for creating customized constraint resolution engines,...
The set constraint/CFL reachability connection in practice (2004)
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new reduction from Dyck-CFL...
Checking and Inferring Local Non-Aliasing (2003)
Alex Aiken, John Kodumal, Jeffrey S. Foster, Tachio Terauchi
In prior work [15] we studied a language construct restrict that allows programmers to specify that certain pointers are not aliased to other pointers used within a lexical scope. Among other...
Flow-sensitive type qualifiers (2002)
Jeffrey S. Foster, Robert Johnson, John Kodumal, Alex Aiken
We describe flow-insensitive type qualifiers, a lightweight, practical mechanism for specifying and checking properties not captured by traditional type systems. We present a framework for adding...