BibSLEIGH — Satish

Travelled to:

1 × Canada
1 × China
1 × France
1 × Ireland
1 × Portugal
1 × Spain
1 × United Kingdom
10 × USA

Collaborated with:

P.M.Chen B.Calder J.Flinn D.Marino M.Musuvathi D.Lee C.Pereira C.Hsiao A.Singh T.D.Millstein K.Veeraraghavan B.Wester G.Pokam D.Devecsery S.Sair J.Yu M.J.Cafarella A.K.Coskun M.Said Z.Yang Y.Hu Z.Wang J.Tigani A.Edwards T.Sherwood G.Varghese Essam Muhammad Idris Khan Cristiano L. Pereira Gilles A. Pokam Vaibhav Gogte Stephan Diestelhorst William Wang T.F.Wenisch J.Ouyang Z.Kong W.Chuang G.Venkatesh J.Sampson M.V.Biesbrouck O.Colavin

Talks about:

analysi (7) race (5) program (4) memori (4) detect (4) data (4) use (4) effici (3) event (3) processor (2)

Person: Satish Narayanasamy

DBLP: Narayanasamy:Satish

Contributed to:

2014

2013

2012

2011

2010

2009

2007

2006

2004

2003

2018

2017

2018

Wrote 22 papers:

OOPSLA-2014-HsiaoCN #corpus #program analysis #statistics #using #web: Using web corpus statistics for program analysis (CHH, MJC, SN), pp. 49–65.
PLDI-2014-HsiaoPYPNCKF #concurrent #detection #mobile: Race detection for event-driven mobile applications (CHH, CP, JY, GP, SN, PMC, ZK, JF), p. 35.
ASPLOS-2013-WesterDCFN #concurrent #detection: Parallelizing data race detection (BW, DD, PMC, JF, SN), pp. 27–38.
OOPSLA-2012-YuNPP #named #parallel #source code #testing #thread: Maple: a coverage-driven testing tool for multithreaded programs (JY, SN, CP, GP), pp. 485–502.
PLDI-2012-LeeCFN #hybrid #named #program analysis: Chimera: hybrid program analysis for determinism (DL, PMC, JF, SN), pp. 463–474.
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.
ASPLOS-2011-VeeraraghavanLWOCFN #named: DoublePlay: parallelizing sequential logging and replay (KV, DL, BW, JO, PMC, JF, SN), pp. 15–26.
HPCA-2011-LeeSNY #analysis #order: Offline symbolic analysis to infer Total Store Order (DL, MS, SN, ZY), pp. 357–358.
PLDI-2011-MarinoSMMN #compilation: A case for an SC-preserving compiler (DM, AS, TDM, MM, SN), pp. 199–210.
SOSP-2011-VeeraraghavanCFN #detection #using: Detecting and surviving data races using complementary schedules (KV, PMC, JF, SN), pp. 369–384.
ASPLOS-2010-LeeWVNCF #multi #named #online #performance: Respec: efficient online multiprocessor replayvia speculation and external determinism (DL, BW, KV, SN, PMC, JF), pp. 77–90.
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.
PLDI-2009-MarinoMN #concurrent #detection #effectiveness #lightweight #named: LiteRace: effective sampling for lightweight data-race detection (DM, MM, SN), pp. 134–143.
DATE-2007-NarayanasamyCC #fault #predict: Transient fault prediction based on anomalies in processor events (SN, AKC, BC), pp. 1140–1145.
PLDI-2007-NarayanasamyWTEC #analysis #automation: Automatically classifying benign and harmful data racesallusing replay analysis (SN, ZW, JT, AE, BC), pp. 22–31.
ASPLOS-2006-ChuangNVSBPCC #bound #memory management #transaction: Unbounded page-based transactional memory (WC, SN, GV, JS, MVB, GP, BC, OC), pp. 347–358.
ASPLOS-2006-NarayanasamyPC #dependence #memory management #using: Recording shared memory dependencies using strata (SN, CP, BC), pp. 229–240.
HPCA-2004-NarayanasamyHSC #convergence #string #using: Creating Converged Trace Schedules Using String Matching (SN, YH, SS, BC), pp. 210–221.
HPCA-2003-NarayanasamySSCV: Catching Accurate Profiles in Hardwar (SN, TS, SS, BC, GV), pp. 269–280.
PLDI-2018-GogteDWNCW: Persistency for synchronization-free regions (VG, SD, WW, SN, PMC, TFW), pp. 46–61.
ASPLOS-2017-HsiaoNKPP #named #scalability: AsyncClock: Scalable Inference of Asynchronous Event Causality (CHH, SN, EMIK, CLP, GAP), pp. 193–205.
ASPLOS-2018-DevecseryCFN #dynamic analysis #hybrid #static analysis: Optimistic Hybrid Analysis: Accelerating Dynamic Analysis through Predicated Static Analysis (DD, PMC, JF, SN), pp. 348–362.