BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Ireland
1 × Switzerland
12 × Canada
2 × Portugal
2 × The Netherlands
3 × Germany
35 × USA
4 × China
4 × France
5 × United Kingdom
Collaborated with:
M.L.Soffa X.Zhang M.Feng R.Bodík N.Gupta Y.Zhang S.Tallam D.Jeffrey C.Tian E.Duesterwald I.Neamtiu A.Krishnaswamy V.Nagarajan K.Vora Y.Wang C.Jaramillo L.N.Bhuyan J.Yang C.Lin M.Spezialetti V.Nagarajan V.Singh S.C.Koduru K.K.Pusukuri L.N.Bhuyan L.Tan Y.Hu W.Chen B.Li E.Mehofer V.Sarkar T.Nakra X.Yuan R.G.Melhem T.Steele F.Khorasani B.Rajaram H.He S.Rele S.Pande S.Önder M.Madou B.D.Sutter L.Gao W.Lee T.Bao Y.Zheng H.Patil C.Pereira G.Lueck
Talks about:
dynam (14) data (13) use (12) slice (11) parallel (10) program (10) flow (8) code (7) base (7) regist (6)

Person: Rajiv Gupta

DBLP DBLP: Gupta:Rajiv

Facilitated 5 volumes:

ASPLOS 2011Ed
CC 2010Ed
PLDI 2008Ed
LCTES 2005Ed
PLDI 2003Ed

Contributed to:

OOPSLA 20152015
SANER 20152015
CGO 20142014
HPDC 20142014
OOPSLA 20142014
PPoPP 20142014
CGO 20132013
ISMM 20132013
SCAM 20132013
ASPLOS 20122012
PLDI 20122012
PPoPP 20122012
PPoPP 20112011
ISMM 20102010
PASTE 20102010
PLDI 20102010
ICPC 20092009
ICSM 20092009
ISMM 20092009
ICSM 20082008
ISSTA 20082008
ICSM 20072007
ISSTA 20072007
PLDI 20072007
FSE 20062006
ICSE 20062006
PLDI 20062006
ASE 20052005
ESEC/FSE 20052005
HPCA 20052005
CGO 20042004
ICSE 20042004
PLDI 20042004
CGO 20032003
ICSE 20032003
LCTES 20032003
POPL 20032003
SAS 20032003
CC 20022002
LCTES/SCOPES 20022002
PLDI 20012001
ASPLOS 20002000
PLDI 20002000
SAS 20002000
CC 19991999
ESEC/FSE 19991999
HPCA 19991999
PLDI 19991999
Best of PLDI 20041998
CC 19981998
PLDI 19981998
ESEC/FSE 19971997
HPCA 19971997
PLDI 19971997
ICSE 19961996
FSE 19951995
ICSM 19951995
POPL 19951995
CC 19941994
ICSM 19941994
PLDI 19931993
CC 19921992
POPL 19921992
ISSTA 19911991
PLDI 19901990
PPoPP 19901990
ASPLOS 19891989
PLDI 19891989
PPEALS 19881988
ICLP 19861986

Wrote 78 papers:

OOPSLA-2015-LeeBZZVG #assessment #float #named #runtime
RAIVE: runtime assessment of floating-point instability by vectorization (WCL, TB, YZ, XZ, KV, RG), pp. 623–638.
SANER-2015-SinghGN #data type #graph #memory management
MG++: Memory graphs for analyzing dynamic data structures (VS, RG, IN), pp. 291–300.
CGO-2014-WangPPLGN #debugging #named #slicing
DrDebug: Deterministic Replay based Cyclic Debugging with Dynamic Slicing (YW, HP, CP, GL, RG, IN), p. 98.
HPDC-2014-KhorasaniVGB #graph #named
CuSha: vertex-centric graph processing on GPUs (FK, KV, RG, LNB), pp. 239–252.
OOPSLA-2014-VoraKG #algorithm #consistency #named #parallel #using
ASPIRE: exploiting asynchronous parallelism in iterative algorithms using a relaxed consistency based DSM (KV, SCK, RG), pp. 861–878.
PPoPP-2014-PusukuriGB #concurrent #thread
Lock contention aware thread migrations (KKP, RG, LNB), pp. 369–370.
CGO-2013-TanFG #detection #fault #lightweight #source code
Lightweight fault detection in parallelized programs (LT, MF, RG), p. 11.
ISMM-2013-WangNG #effectiveness #generative #memory management
Generating sound and effective memory debuggers (YW, IN, RG), pp. 51–62.
SCAM-2013-WangFGN #debugging #interactive
A state alteration and inspection-based interactive debugger (YW, MF, RG, IN), pp. 84–93.
ASPLOS-2012-LinNGR #consistency #performance
Efficient sequential consistency via conflict ordering (CL, VN, RG, BR), pp. 273–286.
PLDI-2012-FengGN #effectiveness #parallel
Effective parallelization of loops in the presence of I/O operations (MF, RG, IN), pp. 487–498.
PPoPP-2012-FengGB #parallel
Speculative parallelization on GPGPUs (MF, RG, LNB), pp. 293–294.
PPoPP-2011-FengGH #commit #named #parallel #scalability
SpiceC: scalable parallelism via implicit copying and explicit commit (MF, RG, YH), pp. 69–80.
PPoPP-2011-TianLFG #incremental #parallel
Enhanced speculative parallelization via incremental recovery (CT, CL, MF, RG), pp. 189–200.
ISMM-2010-TianFG #parallel #predict #using
Speculative parallelization using state separation and multiple value prediction (CT, MF, RG), pp. 63–72.
PASTE-2010-FengG #fault #learning #locality #modelling #probability
Learning universal probabilistic models for fault localization (MF, RG), pp. 81–88.
PLDI-2010-TianFG #data type #parallel
Supporting speculative parallelization in the presence of dynamic data structures (CT, MF, RG), pp. 62–73.
ICPC-2009-JeffreyFGG #debugging #developer #named
BugFix: A learning-based tool to assist developers in fixing bugs (DJ, MF, NG, RG), pp. 70–79.
ICSM-2009-FengG #detection
Detecting virus mutations via dynamic matching (MF, RG), pp. 105–114.
ICSM-2009-JeffreyGG #effectiveness #fault #locality #multi #performance #using
Effective and efficient localization of multiple faults using value replacement (DJ, NG, RG), pp. 221–230.
ISMM-2009-NagarajanJG #self #source code
Self-recovery in server programs (VN, DJ, RG), pp. 49–58.
ICSM-2008-JeffreyGG #debugging #identification #memory management #using
Identifying the root causes of memory bugs using corrupted memory location suppression (DJ, NG, RG), pp. 356–365.
ICSM-2008-TallamTG #concurrent #detection #parallel #slicing #source code #thread
Dynamic slicing of multithreaded programs for race detection (ST, CT, RG), pp. 97–106.
ISSTA-2008-JeffreyGG #fault #locality #using
Fault localization using value replacement (DJ, NG, RG), pp. 167–178.
ISSTA-2008-TianNGT #concurrent #detection #recognition
Dynamic recognition of synchronization operations for improved data race detection (CT, VN, RG, ST), pp. 143–154.
ICSM-2007-NagarajanGMZS #control flow
Matching Control Flow of Program Versions (VN, RG, MM, XZ, BDS), pp. 84–93.
ICSM-2007-NagarajanJGG #debugging #named #online #performance
ONTRAC: A system for efficient ONline TRACing for debugging (VN, DJ, RG, NG), pp. 445–454.
ISSTA-2007-TallamTGZ #execution #parallel #reduction #source code #thread
Enabling tracing Of long-running multithreaded programs via dynamic execution reduction (ST, CT, RG, XZ), pp. 207–218.
PLDI-2007-ZhangTGG #execution #fault #towards
Towards locating execution omission errors (XZ, ST, NG, RG), pp. 415–424.
FSE-2006-ZhangTG #execution #performance #slicing #source code
Dynamic slicing long running programs through execution fast forwarding (XZ, ST, RG), pp. 81–91.
ICSE-2006-ZhangGG #automation #fault
Locating faults through automated predicate switching (XZ, NG, RG), pp. 272–281.
PLDI-2006-ZhangGG #dynamic analysis #slicing
Pruning dynamic slices with confidence (XZ, NG, RG), pp. 169–180.
ASE-2005-GuptaHZG #using
Locating faulty code using failure-inducing chops (NG, HH, XZ, RG), pp. 263–272.
ESEC-FSE-2005-ZhangG #execution
Matching execution histories of program versions (XZ, RG), pp. 197–206.
HPCA-2005-ZhangGYZG #memory management #multi #named #security #symmetry
SENSS: Security Enhancement to Symmetric Shared Memory Multiprocessors (YZ, LG, JY, XZ, RG), pp. 352–362.
CGO-2004-TallamZG #bound #profiling
Extending Path Profiling across Loop Backedges and Procedure Boundaries (ST, XZ, RG), pp. 251–264.
ICSE-2004-ZhangGZ #diagrams #dynamic analysis #order #performance #slicing #using
Efficient Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams (XZ, RG, YZ), pp. 502–511.
PLDI-2004-ZhangG #effectiveness #slicing
Cost effective dynamic program slicing (XZ, RG), pp. 94–106.
CGO-2003-ZhangG #security #slicing
Hiding Program Slices for Software Security (XZ, RG), pp. 325–336.
ICSE-2003-ZhangGZ #algorithm #precise #slicing
Precise Dynamic Slicing Algorithms (XZ, RG, YZ), pp. 319–329.
LCTES-2003-Krishnaswamy #performance #using
Enhancing the performance of 16-bit code using augmenting instructions (AK, RG), pp. 254–264.
POPL-2003-TallamG
Bitwidth aware global register allocation (ST, RG), pp. 85–96.
SAS-2003-ChenLG #multi
Code Compaction of Matching Single-Entry Multiple-Exit Regions (WKC, BL, RG), pp. 401–417.
CC-2002-GuptaMZ #analysis #optimisation #representation
A Representation for Bit Section Based Analysis and Optimization (RG, EM, YZ), pp. 62–77.
CC-2002-RelePOG #functional #optimisation
Optimizing Static Power Dissipation by Functional Units in Superscalar Processors (SR, SP, , RG), pp. 261–275.
CC-2002-ZhangG #data type
Data Compression Transformations for Dynamically Allocated Data Structures (YZ, RG), pp. 14–28.
LCTES-SCOPES-2002-KrishnaswamyG
Profile guided selection of ARM and thumb instructions (AK, RG), pp. 56–64.
PLDI-2001-ZhangG #representation
Timestamped Whole Program Path Representation and its Applications (YZ, RG), pp. 180–190.
ASPLOS-2000-ZhangYG #design #locality
Frequent Value Locality and Value-Centric Data Cache Design (YZ, JY, RG), pp. 150–159.
PLDI-2000-BodikGS #array #bound #named
ABCD: eliminating array bounds checks on demand (RB, RG, VS), pp. 321–333.
SAS-2000-JaramilloGS #debugging #named
FULLDOC: A Full Reporting Debugger for Optimized Code (CJ, RG, MLS), pp. 240–259.
CC-1999-GuptaB
Register Pressure Sensitive Redundancy Elimination (RG, RB), pp. 107–121.
ESEC-FSE-1999-JaramilloGS #approach #comparison #debugging
Comparison Checking: An Approach to Avoid Debugging of Optimized Code (CJ, RG, MLS), pp. 268–284.
HPCA-1999-NakraGS #predict
Global Context-Based Value Prediction (TN, RG, MLS), pp. 4–12.
PLDI-1999-BodikGS #analysis #design #evaluation
Load-Reuse Analysis: Design and Evaluation (RB, RG, MLS), pp. 64–76.
Best-of-PLDI-1998-BodikGS98a
Complete removal of redundant expressions (with retrospective) (RB, RG, MLS), pp. 596–611.
CC-1998-Gupta #framework #scheduling
A Code Motion Framework for Global Instruction Scheduling (RG), pp. 219–233.
PLDI-1998-BodikGS
Complete Removal of Redundant Computations (RB, RG, MLS), pp. 1–14.
ESEC-FSE-1997-BodikGS #data flow #using
Refining Data Flow Information Using Infeasible Paths (RB, RG, MLS), pp. 361–377.
HPCA-1997-YuanMG #algorithm #distributed #multi #network
Distributed Path Reservation Algorithms for Multiplexed All-Optical Interconnection Networks (XY, RGM, RG), pp. 38–47.
PLDI-1997-BodikG #slicing #using
Partial Dead Code Elimination using Slicing Transformations (RB, RG), pp. 159–170.
PLDI-1997-BodikGS #branch #interprocedural
Interprocedural Conditional Branch Elimination (RB, RG, MLS), pp. 146–158.
ICSE-1996-DuesterwaldGS #data flow #integration #testing
A Demand-Driven Analyzer for Data Flow Testing at the Integration Level (ED, RG, MLS), pp. 575–584.
FSE-1995-GuptaS #approach #hybrid #information management #slicing #using
Hybrid Slicing: An Approach for Refining Static Slices Using Dynamic Information (RG, MLS), pp. 29–40.
ICSM-1995-GuptaS #data flow #testing
Priority based data flow testing (RG, MLS), pp. 348–357.
POPL-1995-DuesterwaldGS #data flow #interprocedural
Demand-driven Computation of Interprocedural Data Flow (ED, RG, MLS), pp. 37–48.
CC-1994-DuesterwaldGS #clustering #congruence #cost analysis #data flow
Reducing the Cost of Data Flow Analysis By Congruence Partitioning (ED, RG, MLS), pp. 357–373.
ICSM-1994-GuptaS #analysis #data flow #framework
A Framework for Partial Data Flow Analysis (RG, MLS), pp. 4–13.
PLDI-1993-DuesterwaldGS #analysis #array #data flow #framework #optimisation
A Practical Data Flow Framework for Array Reference Analysis and its Use in Optimizations (ED, RG, MLS), pp. 68–77.
CC-1992-DuesterwaldGS #approach #pipes and filters
Register Pipelining: An Integrated Approach to Register Allocation for Scalar and Subscripted Variables (ED, RG, MLS), pp. 192–206.
POPL-1992-Gupta
Generalized Dominators and Post-Dominators (RG), pp. 246–257.
TAV-1991-GuptaS #approach #detection #performance #runtime
Loop Monotonic Computations: An Approach for the Efficient Run-Time Detection of Races (RG, MS), pp. 98–111.
PLDI-1990-Gupta #array #bound #fresh look #optimisation
A Fresh Look at Optimizing Array Bound Checking (RG), pp. 272–282.
PPoPP-1990-Gupta #parallel
Employing Register Channels for the Exploitation of Instruction Level Parallelism (RG), pp. 118–127.
ASPLOS-1989-Gupta #fuzzy
The Fuzzy Barrier: A Mechanism for High Speed Synchronization of Processors (RG), pp. 54–63.
PLDI-1989-GuptaSS #clique
Register Allocation via Clique Separators (RG, MLS, TS), pp. 264–274.
PPEALS-1988-GuptaS #parallel #performance
Compile-time Techniques for Efficient Utilization of Parallel Memories (RG, MLS), pp. 235–246.
ICLP-1986-Gupta86 #generative #prolog
Test-pattern Generation for VLSI Circuits in a Prolog Environment (RG), pp. 528–535.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.