Travelled to:
1 × Austria
1 × France
1 × Germany
1 × Korea
1 × New Zealand
1 × Portugal
1 × South Africa
1 × Spain
1 × Switzerland
1 × United Kingdom
16 × USA
2 × Italy
4 × Canada
Collaborated with:
M.Hicks M.Furr A.Aiken Y.P.Khoo M.W.Hicks J.(.An K.Ma M.Fähndrich S.Srivastava S.Gulwani P.Pratikakis B.M.Ren X.Qiu A.Solar-Lezama A.Chaudhuri I.Neamtiu T.Terauchi C.Song A.Porter J.Jeon D.Greenfieldboyce M.A.Hammer D.V.Horn T.Nguyen B.E.Chang W.Pugh J.Toman T.S.Strickland S.Chaudhuri V.Sazawal J.Kodumal Z.Su C.M.Hayden E.K.Smith M.Denchev E.Reisner U.Koc J.Cheng A.A.Porter S.Wei P.Mardziel A.Ruef M.H.0001 Milod Kazerounian S.N.Guria N.Vazou J.Dunfield K.Headley N.Labich Benjamin Mariano J.Reese Siyuan Xu
Talks about:
type (13) static (8) infer (8) program (7) dynam (6) softwar (5) analysi (5) rubi (5) synthesi (4) check (4)
Person: Jeffrey S. Foster
DBLP: Foster:Jeffrey_S=
Facilitated 1 volumes:
Contributed to:
Wrote 38 papers:
- CAV-2015-JeonQSF #adaptation #parallel #synthesis
- Adaptive Concretization for Parallel Program Synthesis (JJ, XQ, ASL, JSF), pp. 377–394.
- ESEC-FSE-2015-JeonQFS #java #named #sketching
- JSketch: sketching for Java (JJ, XQ, JSF, ASL), pp. 934–937.
- OOPSLA-2015-HammerDHLFHH #incremental
- Incremental computation with names (MAH, JD, KH, NL, JSF, MWH, DVH), pp. 748–766.
- PLDI-2014-HammerKHF #adaptation #composition #incremental #named
- Adapton: composable, demand-driven incremental computation (MAH, YPK, MH, JSF), p. 18.
- ICSE-2013-KhooFH #debugging #named
- Expositor: scriptable time-travel debugging with first-class traces (YPK, JSF, MH), pp. 352–361.
- SAC-2013-RenTSF #ruby
- The ruby type checker (BMR, JT, TSS, JSF), pp. 1565–1572.
- ICSE-2012-SongPF #interactive #named #using
- iTree: Efficiently discovering high-coverage configurations using interaction trees (CS, AP, JSF), pp. 903–913.
- OOPSLA-2012-HaydenSDHF #c #named #performance
- Kitsune: efficient, general-purpose dynamic software updating for C (CMH, EKS, MD, MH, JSF), pp. 249–264.
- PLDI-2011-SrivastavaGCF #induction #synthesis
- Path-based inductive synthesis for program inversion (SS, SG, SC, JSF), pp. 492–503.
- POPL-2011-AnCFH #ruby #static typing
- Dynamic inference of static types for ruby (Jh(A, AC, JSF, MH), pp. 459–472.
- SAS-2011-MaKFH #execution #symbolic computation
- Directed Symbolic Execution (KKM, YPK, JSF, MH), pp. 95–111.
- ICSE-2010-ReisnerSMFP #behaviour #configuration management #evaluation #symbolic computation #using
- Using symbolic evaluation to understand behavior in configurable software systems (ER, CS, KKM, JSF, AP), pp. 445–454.
- PLDI-2010-KhooCF #execution #symbolic computation #type checking
- Mixing type checking and symbolic execution (YPK, BYEC, JSF), pp. 436–447.
- POPL-2010-SrivastavaGF #synthesis #verification
- From program verification to program synthesis (SS, SG, JSF), pp. 313–326.
- ASE-2009-AnCF #ruby #static typing #type system
- Static Typing for Ruby on Rails (Jh(A, AC, JSF), pp. 590–594.
- CAV-2009-SrivastavaGF #named #smt #verification
- VS3: SMT Solvers for Program Verification (SS, SG, JSF), pp. 702–708.
- OOPSLA-2009-FurrAF #scripting language #static typing #type system
- Profile-guided static typing for dynamic scripting languages (MF, Jh(A, JSF), pp. 283–300.
- SAC-2009-FurrAFH #ruby #static typing #type inference
- Static type inference for Ruby (MF, Jh(A, JSF, MWH), pp. 1859–1866.
- PASTE-2008-KhooFHS #static analysis #tool support
- Path projection for user-centered static analysis tools (YPK, JSF, MH, VS), pp. 57–63.
- POPL-2008-NeamtiuHFP #concurrent #programming
- Contextual effects for version-consistent dynamic software updating and safe concurrent programming (IN, MH, JSF, PP), pp. 37–49.
- OOPSLA-2007-GreenfieldboyceF #java
- Type qualifier inference for java (DG, JSF), pp. 321–336.
- OOPSLA-2007-MaF #alias #encapsulation #java
- Inferring aliasing and encapsulation properties for java (KKM, JSF), pp. 423–440.
- PASTE-2007-FosterHP #quality #static analysis
- Improving software quality with static analysis (JSF, MWH, WP), pp. 83–84.
- ESOP-2006-FurrF #polymorphism #type inference
- Polymorphic Type Inference for the JNI (MF, JSF), pp. 309–324.
- PLDI-2006-PratikakisFH #analysis #concurrent #correlation #detection #named
- LOCKSMITH: context-sensitive correlation analysis for race detection (PP, JSF, MWH), pp. 320–331.
- SAS-2006-PratikakisFH #reachability
- Existential Label Flow Inference Via CFL Reachability (PP, JSF, MH), pp. 88–106.
- MSR-2005-NeamtiuFH #abstract syntax tree #comprehension #evolution #source code #syntax #using
- Understanding source code evolution using abstract syntax tree matching (IN, JSF, MWH), pp. 81–85.
- PLDI-2005-FurrF #type safety
- Checking type safety of foreign function calls (MF, JSF), pp. 62–72.
- PLDI-2003-AikenFKT #alias
- Checking and inferring local non-aliasing (AA, JSF, JK, TT), pp. 129–140.
- PLDI-2002-FosterTA
- Flow-Sensitive Type Qualifiers (JSF, TT, AA), pp. 1–12.
- SAS-2000-FosterFA #analysis #c #points-to #polymorphism
- Polymorphic versus Monomorphic Flow-Insensitive Points-to Analysis for C (JSF, MF, AA), pp. 175–198.
- PLDI-1999-FosterFA #formal method
- A Theory of Type Qualifiers (JSF, MF, AA), pp. 192–203.
- PLDI-1998-FahndrichFSA #constraints #graph #online
- Partial Online Cycle Elimination in Inclusion Constraint Graphs (MF, JSF, ZS, AA), pp. 85–96.
- FSE-2016-NguyenKCFP #configuration management #interactive #named
- iGen: dynamic interaction inference for configurable software (TN, UK, JC, JSF, AAP), pp. 655–665.
- ESOP-2018-WeiMRF0 #design #java #static analysis #trade-off
- Evaluating Design Tradeoffs in Numeric Static Analysis for Java (SW, PM, AR, JSF, MH0), pp. 653–682.
- OOPSLA-2019-MarianoRXNQFS #algebra #library #specification #synthesis
- Program synthesis with algebraic library specifications (BM, JR, SX, TN, XQ, JSF, ASL), p. 25.
- PLDI-2016-RenF #static typing #type checking
- Just-in-time static type checking for dynamic languages (BMR, JSF), pp. 462–476.
- PLDI-2019-KazerounianGVFH #library #ruby
- Type-level computations for Ruby libraries (MK, SNG, NV, JSF, DVH), pp. 966–979.