Travelled to:
1 × Cyprus
1 × Italy
1 × Portugal
1 × Slovenia
2 × Austria
2 × France
2 × Switzerland
20 × USA
3 × Canada
Collaborated with:
C.Chambers B.Chin S.Markstrum M.Musuvathi D.Marino R.Majumdar H.Samimi A.Warth G.T.Leavens S.Padhi Lun Liu A.Singh S.Narayanasamy M.Lesani J.Palsberg J.Fischer S.Lerner R.S.0001 ∅ M.Schäfer F.Tip E.D.Aung R.M.Fuhrer J.R.Douglass M.Stanojevic M.Reay C.Bleckner A.Y.Levy M.Friedman T.Felgentreff A.Borning R.Hirschfeld L.Gomez I.Neamtiu T.Azim R.Hicks A.Fogel S.D.Tetali N.Kothari R.Gummadi R.Govindan C.Andreae J.Noble E.Rice T.Ball S.K.Rajamani C.Clifton A.V.Nori C.Deaton Y.Ohshima A.Feldthaus A.Møller R.Beckett R.Mahajan J.Padhye D.Walker S.Artzi L.J.Hendren Prateek Jain 0002 D.Perelman O.Polozov S.Gulwani
Talks about:
program (6) support (5) dispatch (4) modular (4) languag (4) applic (4) type (4) java (4) data (4) constraint (3)
♂ Person: Todd D. Millstein
DBLP: Millstein:Todd_D=
Facilitated 3 volumes:
Contributed to:
Wrote 40 papers:
- OOPSLA-2015-FelgentreffMBH #constraints #programming language #theorem proving
- Checks and balances: constraint solving without surprises in object-constraint programming languages (TF, TDM, AB, RH), pp. 767–782.
- CAV-2014-LesaniMP #automation #concurrent #data type #verification
- Automatic Atomicity Verification for Clients of Concurrent Data Structures (ML, TDM, JP), pp. 550–567.
- Onward-2014-SamimiDOWM #call-by
- Call by Meaning (HS, CD, YO, AW, TDM), pp. 11–28.
- ICSE-2013-GomezNAM #android #named
- RERAN: timing- and touch-sensitive record and replay for Android (LG, IN, TA, TDM), pp. 72–81.
- ISSTA-2013-SamimiHFM #declarative
- Declarative mocking (HS, RH, AF, TDM), pp. 246–256.
- OOPSLA-2013-TetaliLMM #named #static analysis
- MrCrypt: static analysis for secure cloud computations (SDT, ML, RM, TDM), pp. 271–286.
- ICSE-2012-SamirniSAMTH #automation #constraints #fault #generative #html #php #string #theorem proving #using
- Automated repair of HTML generation errors in PHP applications using string constraint solving (HS, MS, SA, TDM, FT, LJH), pp. 277–287.
- ASPLOS-2011-SinghMNMM #exception #memory management #performance
- Efficient processor support for DRFx, a memory model with exceptions (AS, DM, SN, TDM, MM), pp. 53–66.
- OOPSLA-2011-FeldthausMMST #javascript #refactoring
- Tool-supported refactoring for JavaScript (AF, TDM, AM, MS, FT), pp. 119–138.
- PLDI-2011-MarinoSMMN #compilation
- A case for an SC-preserving compiler (DM, AS, TDM, MM, SN), pp. 199–210.
- ECOOP-2010-SamimiAM #execution #specification
- Falling Back on Executable Specifications (HS, EDA, TDM), pp. 552–576.
- PLDI-2010-MarinoSMMN #concurrent #memory management #named #performance #programming language
- DRFX: a simple and efficient memory model for concurrent programming languages (DM, AS, TDM, MM, SN), pp. 351–362.
- ECOOP-2009-FischerMMM #data access #fine-grained
- Fine-Grained Access Control with Object-Sensitive Roles (JF, DM, RM, TDM), pp. 173–194.
- PPoPP-2009-MarkstrumFM #concurrent #refactoring #towards
- Towards concurrency refactoring for x10 (SM, RMF, TDM), pp. 303–304.
- ECOOP-2008-ChinM #interactive #state machine
- An Extensible State Machine Pattern for Interactive Applications (BC, TDM), pp. 566–591.
- PEPM-2008-WarthDM #parsing #recursion
- Packrat parsers can support left recursion (AW, JRD, TDM), pp. 103–110.
- PASTE-2007-ChinMMM #programming #validation
- Enforcing and validating user-defined programming disciplines (BC, DM, SM, TDM), pp. 85–86.
- PEPM-2007-FischerMM #named #programming
- Tasks: language support for event-driven programming (JF, RM, TDM), pp. 134–143.
- PLDI-2007-KothariGMG #abstraction #network #performance #programming #reliability
- Reliable and efficient programming abstractions for wireless sensor networks (NK, RG, TDM, RG), pp. 200–210.
- ECOOP-2006-ChinM #interactive #named
- Responders: Language Support for Interactive Applications (BC, TDM), pp. 255–278.
- ESOP-2006-ChinMMP
- Inference of User-Defined Type Qualifiers and Qualifier Rules (BC, SM, TDM, JP), pp. 264–278.
- OOPSLA-2006-AndreaeNMM #framework #implementation #type system
- A framework for implementing pluggable type systems (CA, JN, SM, TDM), pp. 57–74.
- OOPSLA-2006-WarthSM #adaptation
- Statically scoped object adaptation with expanders (AW, MS, TDM), pp. 37–56.
- PLDI-2005-ChinMM #semantics
- Semantic type qualifiers (BC, SM, TDM), pp. 85–95.
- POPL-2005-LernerMRC #analysis #automation #data flow #proving
- Automated soundness proofs for dataflow analyses and transformations via local rules (SL, TDM, ER, CC), pp. 364–377.
- OOPSLA-2004-Millstein
- Practical predicate dispatch (TDM), pp. 345–364.
- OOPSLA-2003-MillsteinRC #composition #multi
- Relaxed MultiJava: balancing extensibility and modular typechecking (TDM, MR, CC), pp. 224–240.
- PLDI-2003-LernerMC #automation #compilation #correctness #optimisation #proving
- Automatically proving the correctness of compiler optimizations (SL, TDM, CC), pp. 220–231.
- ICFP-2002-MillsteinBC #composition #data type
- Modular typechecking for hierarchically extensible datatypes and functions (TDM, CB, CC), pp. 110–122.
- PLDI-2001-BallMMR #abstraction #automation #c #source code
- Automatic Predicate Abstraction of C Programs (TB, RM, TDM, SKR), pp. 203–213.
- OOPSLA-2000-CliftonLCM #composition #java #multi #named #symmetry
- MultiJava: modular open classes and symmetric multiple dispatch for Java (CC, GTL, CC, TDM), pp. 130–145.
- PODS-2000-MillsteinLF #integration #query
- Query Containment for Data Integration Systems (TDM, AYL, MF), pp. 67–75.
- ECOOP-1999-MillsteinC #composition #multi #static typing
- Modular Statically Typed Multimethods (TDM, CC), pp. 279–303.
- OOPSLA-1998-LeavensM #multi #tuple
- Multiple Dispatch as Dispatch on Tuples (GTL, TDM), pp. 374–387.
- CAV-2019-PadhiMN0 #synthesis #theory and practice
- Overfitting in Synthesis: Theory and Practice (SP, TDM, AVN, RS0), pp. 315–334.
- OOPSLA-2017-LiuMM #virtual machine
- A volatile-by-default JVM for server applications (LL, TDM, MM), p. 25.
- OOPSLA-2018-PadhiJPPGM #framework #named
- FlashProfile: a framework for synthesizing data profiles (SP, PJ0, DP, OP, SG, TDM), p. 28.
- PLDI-2016-PadhiSM #data-driven
- Data-driven precondition inference with learned features (SP, RS0, TDM), pp. 42–56.
- PLDI-2017-BeckettMMPW #network #synthesis
- Network configuration synthesis with abstract topologies (RB, RM, TDM, JP, DW), pp. 437–451.
- PLDI-2019-LiuMM #compilation #consistency #java
- Accelerating sequential consistency for Java with speculative compilation (LL, TDM, MM), pp. 16–30.