Travelled to:1 × Austria
1 × Germany
1 × Ireland
1 × Slovenia
1 × The Netherlands
14 × USA
2 × Canada
2 × China
3 × Italy
Collaborated with:F.Tip S.J.Fink S.Chandra M.Schäfer J.Dolby B.E.Chang R.Bodík M.T.Vechev S.Blackshear S.C.0001 K.Sen C.Schlesinger V.Raychev L.Clapp J.Jeannin I.Shlyakhter D.Jackson G.Tesauro M.Pistoia O.Tripp S.Heule G.(.Xu A.Rountev J.Wloka S.Banerjee C.S.Gordon S.H.Jensen L.Gong M.Pradel C.Radoi R.M.Rabbah N.Sinha N.Singhania B.Petrov S.Sankaranarayanan D.Gopan L.Shan B.S.0002 C.Loncaric R.Barik M.K.Ramanathan M.Chabbi A.Feldthaus E.Torlak O.Weisman R.Manevich S.Adams M.Das Z.Yang R.Seater M.Taghdiri A.M.Dan Julie L. Newcomb S.Artzi S.Guarnieri R.Berg J.Choi K.Lee A.Loginov R.O'Callahan V.Sarkar E.Andreasen Y.Choi
Talks about:analysi (11) type (6) javascript (5) program (5) practic (5) java (5) base (5) refactor (4) point (4) code (4)
Person: Manu Sridharan
DBLP: Sridharan:Manu
Contributed to:
2015
2015
20152014
20132013
2013
2012
2012201220112011
201120102009200920092009200720062005
2004
200320022001
200020182019201720162016
20172019Wrote 38 papers:
- ESEC-FSE-2015-HeuleSC #modelling #named
- Mimic: computing models for opaque code (SH, MS, SC), pp. 710–720.
- ESEC-FSE-2015-JensenSSC #debugging #independence #javascript #memory management #named #platform
- MemInsight: platform-independent memory debugging for JavaScript (SHJ, MS, KS, SC), pp. 345–356.
- ISSTA-2015-GongPSS #javascript #named
- DLint: dynamically checking bad coding practices in JavaScript (LG, MP, MS, KS), pp. 94–105.
- OOPSLA-2015-BlackshearCS #abstraction #control flow
- Selective control-flow abstraction via jumping (SB, BYEC, MS), pp. 163–182.
- OOPSLA-2014-RadoiFRS #imperative #pipes and filters
- Translating imperative code to MapReduce (CR, SJF, RMR, MS), pp. 909–927.
- ICSE-2013-FeldthausSSDT #approximate #graph #ide #javascript #performance
- Efficient construction of approximate call graphs for JavaScript IDE services (AF, MS, MS, JD, FT), pp. 752–761.
- OOPSLA-2013-RaychevSSV #refactoring #synthesis
- Refactoring with synthesis (VR, MS, MS, MTV), pp. 339–354.
- OOPSLA-2013-RaychevVS #concurrent #detection #effectiveness #source code
- Effective race detection for event-driven programs (VR, MTV, MS), pp. 151–166.
- PLDI-2013-BlackshearCS #named #precise #reachability
- Thresher: precise refutations for heap reachability (SB, BYEC, MS), pp. 275–286.
- PLDI-2013-SchaferSDT #analysis
- Dynamic determinacy analysis (MS, MS, JD, FT), pp. 165–174.
- CAV-2012-SinhaSCS
- Alternate and Learn: Finding Witnesses without Looking All over (NS, NS, SC, MS), pp. 599–615.
- ECOOP-2012-SridharanDCST #analysis #correlation #javascript #points-to
- Correlation Tracking for Points-To Analysis of JavaScript (MS, JD, SC, MS, FT), pp. 435–458.
- PLDI-2012-PetrovVSD #concurrent #detection #web
- Race detection for web applications (BP, MTV, MS, JD), pp. 251–262.
- ICSE-2011-SchaferSDT #flexibility #java #refactoring #source code
- Refactoring Java programs for flexible locking (MS, MS, JD, FT), pp. 71–80.
- OOPSLA-2011-SridharanAPGTB #analysis #named #web
- F4F: taint analysis of framework-based web applications (MS, SA, MP, SG, OT, RB), pp. 1053–1068.
- SAS-2011-BlackshearCSS #analysis #precise
- The Flow-Insensitive Precision of Andersen’s Analysis in Practice (SB, BYEC, SS, MS), pp. 60–76.
- ECOOP-2010-SchaferDSTT #concurrent #java #refactoring
- Correct Refactoring of Concurrent Java Code (MS, JD, MS, ET, FT), pp. 225–249.
- ECOOP-2009-XuRS #alias #analysis #points-to #scalability #using
- Scaling CFL-Reachability-Based Points-To Analysis Using Context-Sensitive Must-Not-Alias Analysis (G(X, AR, MS), pp. 98–122.
- ESEC-FSE-2009-WlokaST #refactoring
- Refactoring for reentrancy (JW, MS, FT), pp. 173–182.
- PLDI-2009-ChandraFS #approach #named
- Snugglebug: a powerful approach to weakest preconditions (SC, SJF, MS), pp. 363–374.
- PLDI-2009-TrippPFSW #analysis #effectiveness #named #web
- TAJ: effective taint analysis of web applications (OT, MP, SJF, MS, OW), pp. 87–97.
- SAS-2009-SridharanF #analysis #complexity
- The Complexity of Andersen’s Analysis in Practice (MS, SJF), pp. 205–221.
- PLDI-2007-SridharanFB #slicing
- Thin slicing (MS, SJF, RB), pp. 112–122.
- PLDI-2006-SridharanB #analysis #java #points-to
- Refinement-based context-sensitive points-to analysis for Java (MS, RB), pp. 387–400.
- OOPSLA-2005-SridharanGSB #analysis #java #points-to
- Demand-driven points-to analysis for Java (MS, DG, LS, RB), pp. 59–76.
- FSE-2004-ManevichSA #named #static analysis
- PSE: explaining program failures via postmortem static analysis (RM, MS, SA, MD, ZY), pp. 63–72.
- ASE-2003-ShlyakhterSJST #debugging #declarative #modelling #satisfiability #using
- Debugging Overconstrained Declarative Models Using Unsatisfiable Cores (IS, RS, DJ, MS, MT), pp. 94–105.
- PLDI-2002-ChoiLLOSS #concurrent #detection #object-oriented #parallel #performance #precise #source code #thread
- Efficient and Precise Datarace Detection for Multithreaded Object-Oriented Programs (JDC, KL, AL, RO, VS, MS), pp. 258–269.
- ESEC-FSE-2001-JacksonSS
- A micromodularity mechanism (DJ, IS, MS), pp. 62–73.
- ICML-2000-SridharanT #automation #multi
- Multi-agent Q-learning and Regression Trees for Automated Pricing Decisions (MS, GT), pp. 927–934.
- ASE-2018-SteinCSC #programming #refinement
- Safe stream-based programming with refinement types (BS0, LC, MS, BYEC), pp. 565–576.
- ESEC-FSE-2019-BanerjeeCS #java #named #null #safety #type system
- NullAway: practical type-based null safety for Java (SB, LC, MS), pp. 740–750.
- CAV-2017-DanS0JV #analysis
- Finding Fix Locations for CFL-Reachability Analyses via Minimum Cuts (AMD, MS, SC0, JBJ, MTV), pp. 521–541.
- ECOOP-2016-AndreasenGCSTS #approach #type system
- Trace Typing: An Approach for Evaluating Retrofitted Type Systems (EA, CSG, SC0, MS, FT, KS), p. 26.
- OOPSLA-2016-ChandraGJSSTC #compilation #javascript #type inference
- Type inference for static compilation of JavaScript (SC, CSG, JBJ, CS, MS, FT, YIC), pp. 410–429.
- OOPSLA-2016-Loncaric0SS #fault #framework #type inference
- A practical framework for type inference error explanation (CL, SC0, CS, MS), pp. 781–799.
- Onward-2017-Newcomb0JSS #automation #calculus #internet
- I¿¿¿: a calculus for internet of things automation (JLN, SC0, JBJ, CS, MS), pp. 119–133.
- OOPSLA-2019-BarikSRC #optimisation #protocol
- Optimization of swift protocols (RB, MS, MKR, MC), p. 27.