Travelled to:
1 × Australia
1 × Canada
1 × Germany
1 × India
1 × Italy
1 × Sweden
2 × Japan
5 × USA
Collaborated with:
∅ D.Kozen D.Walker S.Smolka A.Guha A.S.0001 H.Hojjat M.Reitblatt J.McClurg P.Cerný K.Fisher C.Monsanto R.Harrison Praveen Kumar 0003 S.Basu James Grimmelmann J.Hsu S.A.Eliopoulos R.Rajkumar S.Lindley J.Cheney K.Q.Zhu M.Milano A.Silva L.Thompson D.M.J.Barbosa J.Cretin M.Greenberg B.C.Pierce K.Mamouras J.DiLorenzo R.Zhang Erin Menzies Matthias Eichholz Eric Campbell G.Salvaneschi M.Mezini L.Princehouse R.Chenchu Z.Jiang K.P.Birman R.Soulé T.Kappé C.J.Anderson J.Jeannin C.Schlesinger M.J.Freedman J.Rexford A.Story David M. Kahn S.Roy L.Kot G.Bender B.Ding C.Koch J.Gehrke
Talks about:
program (8) network (8) languag (6) probabilist (3) lens (3) net (3) kat (3) protocol (2) filestor (2) foundat (2)
♂ Person: Nate Foster
DBLP: Foster:Nate
Facilitated 1 volumes:
Contributed to:
Wrote 23 papers:
- ICFP-2015-SmolkaEFG #compilation #performance
- A fast compiler for NetKAT (SS, SAE, NF, AG), pp. 328–341.
- PLDI-2015-McClurgHCF #network #performance #synthesis
- Efficient synthesis of network updates (JM, HH, PC, NF), pp. 196–207.
- POPL-2015-FosterKM0T #algebra
- A Coalgebraic Decision Procedure for NetKAT (NF, DK, MM, AS, LT), pp. 343–355.
- SIGMOD-2015-0002KBDHKFG #coordination #program analysis #protocol #transaction
- The Homeostasis Protocol: Avoiding Transaction Coordination Through Program Analysis (SR, LK, GB, BD, HH, CK, NF, JG), pp. 1311–1326.
- ECOOP-2014-PrincehouseCJBFS #architecture #composition #named #protocol
- MiCA: A Compositional Architecture for Gossip Protocols (LP, RC, ZJ, KPB, NF, RS), pp. 644–669.
- POPL-2014-AndersonFGJKSW #named #network #semantics
- NetkAT: semantic foundations for networks (CJA, NF, AG, JBJ, DK, CS, DW), pp. 113–126.
- BX-2013-RajkumarFLC #lens #web
- Lenses for Web Data (RR, NF, SL, JC), pp. 90–110.
- PLDI-2013-GuhaRF #network
- Machine-verified network controllers (AG, MR, NF), pp. 483–494.
- POPL-2012-MonsantoFHW #compilation #network #programming language #runtime
- A compiler and run-time system for network programming languages (CM, NF, RH, DW), pp. 217–230.
- BX-2011-Foster #bidirectional
- Languages for Bidirectional Transformations (NF), p. 49.
- ICFP-2011-FisherFWZ #named #programming #tool support
- Forest: a language and toolkit for programming with filestores (KF, NF, DW, KQZ), pp. 292–306.
- ICFP-2011-FosterHFMRSW #named #network #programming language
- Frenetic: a network programming language (NF, RH, MJF, CM, JR, AS, DW), pp. 279–291.
- ICFP-2010-BarbosaCFGP #lens
- Matching lenses: alignment and view update (DMJB, JC, NF, MG, BCP), pp. 193–204.
- BX-2008-Foster
- Languages Short Talk 7 (NF), p. 7.
- BX-2008-Foster1 #lens
- Quotient Lenses (NF), p. 31.
- ESOP-2016-FosterKMR0 #probability
- Probabilistic NetKAT (NF, DK, KM, MR, AS0), pp. 282–309.
- OOPSLA-2016-DiLorenzoZMFF #domain-specific language #incremental
- Incremental forest: a DSL for efficiently managing filestores (JD, RZ, EM, KF, NF), pp. 252–271.
- ECOOP-2019-EichholzCFSM #how #programming #type safety
- How to Avoid Making a Billion-Dollar Mistake: Type-Safe Data Plane Programming with SafeP4 (ME, EC, NF, GS, MM), p. 28.
- Onward-2019-BasuFG #programming language
- Property conveyances as a programming language (SB, NF, JG), pp. 128–142.
- PLDI-2016-McClurgHFC #network #programming
- Event-driven network programming (JM, HH, NF, PC), pp. 369–385.
- POPL-2017-SmolkaKFK0 #network #probability #semantics
- Cantor meets scott: semantic foundations for probabilistic networks (SS, PK0, NF, DK, AS0), pp. 557–571.
- PLDI-2019-SmolkaKKFHK0 #network #probability #scalability #verification
- Scalable verification of probabilistic networks (SS, PK0, DMK, NF, JH, DK, AS0), pp. 190–203.
- POPL-2020-SmolkaFHKKS #algebra #linear #source code #testing #verification
- Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time (SS, NF, JH, TK, DK, AS0), p. 28.