Travelled to:1 × Canada
1 × China
1 × France
1 × Ireland
1 × Poland
1 × Sweden
1 × The Netherlands
18 × USA
2 × Italy
2 × United Kingdom
Collaborated with:Y.A.Liu L.Wang L.Unnikrishnan M.Gorbovitski R.Agarwal ∅ T.Rothamel B.Lin A.Sasturkar E.Cohen N.Li T.Teitelbaum Saksham Chand Q.Chen Z.Yang Jon Brandvein K.T.Tekle Y.E.Liu F.Yu N.Hu R.Grosu S.A.Smolka J.Yan M.I.Gofman R.Luo A.C.Solomon Y.Zhang P.Yang
Talks about:analysi (8) program (6) effici (6) optim (6) increment (5) detect (5) base (5) atom (5) distribut (4) queri (4)
Person: Scott D. Stoller
DBLP: Stoller:Scott_D=
Contributed to:
2012
2012
2009
2009
2009
2009
2008
2006
2006
200520052005
2004
20042003
200320032003
200220022001
2001
2001
2001
20002000
199919991998
199620162019Wrote 33 papers:
- OOPSLA-2012-LiuSLG #algorithm #distributed #performance
- From clarity to efficiency for distributed algorithms (YAL, SDS, BL, MG), pp. 395–410.
- PEPM-2012-GorbovitskiLSR #optimisation
- Composing transformations for instrumentation and optimization (MG, YAL, SDS, TR), pp. 53–62.
- FASE-2009-ChenWYS #detection #named #static analysis
- HAVE: Detecting Atomicity Violations via Integrated Dynamic and Static Analysis (QC, LW, ZY, SDS), pp. 425–439.
- GPCE-2009-LiuGS #framework #invariant
- A language and framework for invariant-driven transformations (YAL, MG, SDS), pp. 55–64.
- ISMM-2009-UnnikrishnanS #analysis #functional #parametricity #source code
- Parametric heap usage analysis for functional programs (LU, SDS), pp. 139–148.
- TACAS-2009-GofmanLSZYS #analysis #data access #named #policy
- RBAC-PAT: A Policy Analysis Tool for Role Based Access Control (MIG, RL, ACS, YZ, PY, SDS), pp. 46–49.
- SCAM-2008-GorbovitskiTRSL #analysis #debugging #performance
- Analysis and Transformations for Efficient Query-Based Debugging (MG, KTT, TR, SDS, YAL), pp. 174–183.
- PADL-2006-LiuS #graph #query
- Querying Complex Graphs (YAL, SDS), pp. 199–214.
- PPoPP-2006-WangS #concurrent #detection #fault #performance #runtime #source code
- Accurate and efficient runtime detection of atomicity errors in concurrent programs (LW, SDS), pp. 137–146.
- ASE-2005-AgarwalSWS #concurrent #detection #runtime #using
- Optimized run-time race detection and atomicity checking using partial discovered types (RA, AS, LW, SDS), pp. 233–242.
- OOPSLA-2005-LiuSGRL #abstraction
- Incrementalization across object abstraction (YAL, SDS, MG, TR, YEL), pp. 473–486.
- PPoPP-2005-SasturkarAWS #analysis #automation #type system
- Automated type-based analysis of data races and atomicity (AS, RA, LW, SDS), pp. 83–94.
- PPoPP-2005-WangS #source code #static analysis
- Static analysis of atomicity for programs with non-blocking synchronization (LW, SDS), pp. 61–71.
- PLDI-2004-LiuRYSH #parametricity #query
- Parametric regular path queries (YAL, TR, FY, SDS, NH), pp. 219–230.
- VMCAI-2004-AgarwalS #java #type inference
- Type Inference for Parameterized Race-Free Java (RA, SDS), pp. 149–160.
- PEPM-2003-LiuS #optimisation
- Optimizing Ackermann’s function by incrementalization (YAL, SDS), pp. 85–91.
- PPDP-2003-LiuS #datalog #performance #source code
- From datalog rules to efficient programs with time and space guarantees (YAL, SDS), pp. 172–183.
- TACAS-2003-StollerC #reduction
- Optimistic Synchronization-Based State-Space Reduction (SDS, EC), pp. 489–504.
- VMCAI-2003-UnnikrishnanSL #analysis #bound
- Optimized Live Heap Bound Analysis (LU, SDS, YAL), pp. 70–85.
- ISSTA-2002-Stoller #clustering
- Domain partitioning for open reactive systems (SDS), pp. 44–54.
- PEPM-2002-LiuS #data type #optimisation #recursion #using
- Program optimization using indexed and recursive data structures (YAL, SDS), pp. 108–118.
- ASE-2001-GrosuLSSY #automation #concurrent #re-engineering #using
- Automated Software Engineering Using Concurrent Class Machines (RG, YAL, SAS, SDS, JY), p. 297–?.
- LCTES-OM-2001-UnnikrishnanSL #analysis #automation #garbage collection #memory management
- Automatic Accurate Live Memory Analysis for Garbage-Collected Languages (LU, SDS, YAL), pp. 102–111.
- LICS-2001-Stoller #bound #protocol
- A Bound on Attacks on Payment Protocols (SDS), pp. 61–70.
- SAS-2001-LiuLS #constraints #grammarware
- Solving Regular Tree Grammar Based Constraints (YAL, NL, SDS), pp. 213–233.
- CAV-2000-StollerUL #detection #distributed #partial order #performance #using
- Efficient Detection of Global Properties in Distributed Systems Using Partial-Order Methods (SDS, LU, YAL), pp. 264–279.
- PEPM-2000-LiuS #optimisation #question #recursion #what
- From Recursion to Iteration: What are the Optimizations? (YAL, SDS), pp. 73–82.
- ESOP-1999-LiuS #programming
- Dynamic Programming via Static Incrementalization (YAL, SDS), pp. 288–305.
- SAS-1999-LiuS #recursion
- Eliminating Dead Code on Recursive Data (YAL, SDS), pp. 211–231.
- CAV-1998-StollerL #detection #distributed #performance
- Efficient Symbolic Detection of Global Properties in Distributed Systems (SDS, YAL), pp. 357–368.
- POPL-1996-LiuST #incremental
- Discovering Auxiliary Information for Incremental Computation (YAL, SDS, TT), pp. 157–170.
- PPDP-2016-LiuBSL #incremental #query
- Demand-driven incremental object queries (YAL, JB, SDS, BL), pp. 228–241.
- PPDP-2019-LiuCS #algorithm #distributed #execution #specification
- Moderately Complex Paxos Made Simple: High-Level Executable Specification of Distributed Algorithms (YAL, SC, SDS), p. 15.