| 2009 |
| 27 | EE | Michael Furr,
Jong-hoon (David) An,
Jeffrey S. Foster,
Michael W. Hicks:
Static type inference for Ruby.
SAC 2009: 1859-1866 |
| 2008 |
| 26 | EE | Yit Phang Khoo,
Jeffrey S. Foster,
Michael Hicks,
Vibha Sazawal:
Path projection for user-centered static analysis tools.
PASTE 2008: 57-63 |
| 25 | EE | Iulian Neamtiu,
Michael Hicks,
Jeffrey S. Foster,
Polyvios Pratikakis:
Contextual effects for version-consistent dynamic software updatingalland safe concurrent programming.
POPL 2008: 37-49 |
| 24 | EE | Polyvios Pratikakis,
Jeffrey S. Foster,
Michael Hicks,
Iulian Neamtiu:
Formalizing Soundness of Contextual Effects.
TPHOLs 2008: 262-277 |
| 23 | EE | Michael Furr,
Jeffrey S. Foster:
Checking type safety of foreign function calls.
ACM Trans. Program. Lang. Syst. 30(4): (2008) |
| 22 | EE | Saurabh Srivastava,
Michael Hicks,
Jeffrey S. Foster,
Patrick Jenkins:
Modular Information Hiding and Type-Safe Linking for C.
IEEE Trans. Software Eng. 34(3): 357-376 (2008) |
| 21 | EE | Octavian Udrea,
Cristian Lumezanu,
Jeffrey S. Foster:
Rule-based static analysis of network protocol implementations.
Inf. Comput. 206(2-4): 130-157 (2008) |
| 2007 |
| 20 | EE | David Greenfieldboyce,
Jeffrey S. Foster:
Type qualifier inference for java.
OOPSLA 2007: 321-336 |
| 19 | EE | Kin-Keung Ma,
Jeffrey S. Foster:
Inferring aliasing and encapsulation properties for java.
OOPSLA 2007: 423-440 |
| 18 | EE | Jeffrey S. Foster,
Michael W. Hicks,
William Pugh:
Improving software quality with static analysis.
PASTE 2007: 83-84 |
| 17 | EE | Saurabh Srivastava,
Michael Hicks,
Jeffrey S. Foster:
Modular information hiding and type-safe linking for C.
TLDI 2007: 3-14 |
| 2006 |
| 16 | EE | Michael Furr,
Jeffrey S. Foster:
Polymorphic Type Inference for the JNI.
ESOP 2006: 309-324 |
| 15 | EE | Polyvios Pratikakis,
Jeffrey S. Foster,
Michael W. Hicks:
LOCKSMITH: context-sensitive correlation analysis for race detection.
PLDI 2006: 320-331 |
| 14 | EE | Polyvios Pratikakis,
Jeffrey S. Foster,
Michael Hicks:
Existential Label Flow Inference Via CFL Reachability.
SAS 2006: 88-106 |
| 13 | EE | Jeffrey S. Foster,
Robert Johnson,
John Kodumal,
Alex Aiken:
Flow-insensitive type qualifiers.
ACM Trans. Program. Lang. Syst. 28(6): 1035-1087 (2006) |
| 2005 |
| 12 | EE | Iulian Neamtiu,
Jeffrey S. Foster,
Michael W. Hicks:
Understanding source code evolution using abstract syntax tree matching.
MSR 2005 |
| 11 | EE | Michael Furr,
Jeffrey S. Foster:
Checking type safety of foreign function calls.
PLDI 2005: 62-72 |
| 10 | EE | Iulian Neamtiu,
Jeffrey S. Foster,
Michael Hicks:
Understanding source code evolution using abstract syntax tree matching.
ACM SIGSOFT Software Engineering Notes 30(4): 1-5 (2005) |
| 2004 |
| 9 | EE | David Greenfieldboyce,
Jeffrey S. Foster:
Visualizing type qualifier inference with Eclipse.
ETX 2004: 57-61 |
| 8 | EE | Nick Rutar,
Christian B. Almazan,
Jeffrey S. Foster:
A Comparison of Bug Finding Tools for Java.
ISSRE 2004: 245-256 |
| 2003 |
| 7 | EE | Alexander Aiken,
Jeffrey S. Foster,
John Kodumal,
Tachio Terauchi:
Checking and inferring local non-aliasing.
PLDI 2003: 129-140 |
| 2002 |
| 6 | EE | Jeffrey S. Foster,
Tachio Terauchi,
Alexander Aiken:
Flow-Sensitive Type Qualifiers.
PLDI 2002: 1-12 |
| 2000 |
| 5 | EE | David Wagner,
Jeffrey S. Foster,
Eric A. Brewer,
Alexander Aiken:
A First Step Towards Automated Detection of Buffer Overrun Vulnerabilities.
NDSS 2000 |
| 4 | | Jeffrey S. Foster,
Manuel Fähndrich,
Alexander Aiken:
Polymorphic versus Monomorphic Flow-Insensitive Points-to Analysis for C.
SAS 2000: 175-198 |
| 1999 |
| 3 | EE | Jeffrey S. Foster,
Manuel Fähndrich,
Alexander Aiken:
A Theory of Type Qualifiers.
PLDI 1999: 192-203 |
| 1998 |
| 2 | | Manuel Fähndrich,
Jeffrey S. Foster,
Zhendong Su,
Alexander Aiken:
Partial Online Cycle Elimination in Inclusion Constraint Graphs.
PLDI 1998: 85-96 |
| 1 | EE | Alexander Aiken,
Manuel Fähndrich,
Jeffrey S. Foster,
Zhendong Su:
A Toolkit for Constructing Type- and Constraint-Based Program Analyses.
Types in Compilation 1998: 78-96 |