BibSLEIGH — Kathryn_S

Travelled to:

1 × China
1 × Croatia
1 × Estonia
1 × France
1 × Greece
1 × Hungary
1 × Italy
1 × Portugal
1 × Spain
1 × Switzerland
1 × Turkey
2 × Germany
2 × Ireland
2 × United Kingdom
34 × USA
7 × Canada

Collaborated with:

M.D.Bond S.M.Blackburn ∅ J.E.B.Moss S.Blackburn M.Jump M.Kim M.Hirzel S.Z.Guyer T.Mytkowicz N.Meng Z.Lu J.B.Sartor B.Lee K.E.Coons E.D.Berger D.Frampton A.Diwan D.Stefanovic R.Grimm B.Cahoon B.G.Zorn X.Yang R.Shahriyar S.Subramanian V.Shmatikov D.Burger A.Sampson S.Khurshid P.Cheng O.Temam S.Coleman X.Huang J.H.Burrill L.Hua J.Bornholt M.Musuvathi S.Son M.W.Hicks M.Grechanik D.E.Perry S.Carr C.Tseng S.W.Keckler N.Nethercote S.Magill M.Hicks R.N.Zaeem D.Gopinath V.Srivastava D.Prountzos R.Manevich K.Pingali B.Wiedermann J.Ha M.Arnold K.Resnick B.Elkarablieh D.Vu K.K.Agaram C.Lin D.Grove R.E.Jones R.D.Blumofe P.R.Wilson Shoaib Akram L.Eeckhout B.A.Maher A.Smith H.Esmaeilzadeh T.Cao I.Roy D.E.Porter E.Witchel S.W.Kent X.Chen S.K.Kushwaha R.A.Chowdhury P.Djeu S.Singhai M.Hertz Hongyu Miao M.Jeon G.Pekhimenko F.X.Lin M.E.Haque Y.H.Eom Y.He S.Elnikety R.Bianchini P.Panchekha D.Grossman L.Ceze A.Kansal T.S.Saponas A.J.B.Brush R.Ziola T.Gao K.Strauss J.R.Larus Z.Wang M.Maas D.G.Andersen M.Isard Mohammad Mahdi Javanmard Colin Raffel J.Gibson B.Yoder M.W.Hall T.J.Harvey K.Kennedy N.McIntosh J.D.Oldham M.H.Paleczny G.Roth M.Gebhart J.R.Diamond P.Gratz M.Marino N.Ranganathan B.Robatmili R.Garner C.Hoffmann A.M.Khan R.Bentzur D.Feinberg A.L.Hosking H.B.Lee A.Phansalkar T.VanDrunen D.v.Dincklage

Talks about:

analysi (11) memori (11) dynam (11) collect (10) program (9) garbag (9) data (8) use (8) perform (6) object (6)

Person: Kathryn S. McKinley

DBLP: McKinley:Kathryn_S=

Facilitated 5 volumes:

Contributed to:

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

2000

1999

1998

1996

1995

1994

1993

2017

2016

2018

2016

2019

2020

Wrote 78 papers:

ASPLOS-2015-HaqueEHEBM #incremental #interactive #latency #named #parallel: Few-to-Many: Incremental Parallelism for Reducing Tail Latency in Interactive Services (MEH, YHE, YH, SE, RB, KSM), pp. 161–175.
ICSE-v1-2015-HuaKM #automation #editing #question #refactoring: Does Automated Refactoring Obviate Systematic Editing? (LH, MK, KSM), pp. 392–402.
ASPLOS-2014-BornholtMM #first-order #named #nondeterminism: Uncertain: a first-order type for uncertain data (JB, TM, KSM), pp. 51–66.
OOPSLA-2014-ShahriyarBM #garbage collection #performance: Fast conservative garbage collection (RS, SMB, KSM), pp. 121–139.
PLDI-2014-SampsonPMMGC #probability #verification: Expressing and verifying probabilistic assertions (AS, PP, TM, KSM, DG, LC), p. 14.
ICSE-2013-MengKM #learning #named: LASE: locating and applying systematic edits by learning from examples (NM, MK, KSM), pp. 502–511.
OOPSLA-2013-CoonsMM #bound #partial order #reduction: Bounded partial-order reduction (KEC, MM, KSM), pp. 833–848.
OOPSLA-2013-KansalSBMMZ #abstraction #energy #latency #mobile #performance: The latency, accuracy, and battery (LAB) abstraction: programmer productivity and energy efficiency for continuous mobile context sensing (AK, TSS, AJBB, KSM, TM, RZ), pp. 661–676.
OOPSLA-2013-ShahriyarBYM: Taking off the gloves with reference counting Immix (RS, SMB, XY, KSM), pp. 93–110.
PLDI-2013-GaoSBMBL #runtime #smarttech #using: Using managed runtime systems to tolerate holes in wearable memories (TG, KS, SMB, KSM, DB, JRL), pp. 297–308.
ECOOP-2012-LeeGHM #metaprogramming #named: Marco: Safe, Expressive Macros for Any Language (BL, RG, MH, KSM), pp. 589–613.
OOPSLA-2012-MagillHSM #automation: Automating object transformations for dynamic software updating (SM, MH, SS, KSM), pp. 265–280.
TACAS-2012-ZaeemGKM #data type #satisfiability #using: History-Aware Data Structure Repair Using SAT (RNZ, DG, SK, KSM), pp. 2–17.
ASPLOS-2011-EsmaeilzadehCXBM #hardware #performance #roadmap #scalability: Looking back on the language and hardware revolutions: measured power, performance, and scaling (HE, TC, XY, SMB, KSM), pp. 319–332.
ESEC-FSE-2011-MengKM #named #program transformation: Sydit: creating and applying a program transformation from an example (NM, MK, KSM), pp. 440–443.
HPCA-2011-McKinley #how #parallel #question: How’s the parallel computing revolution going? (KSM), p. 217.
OOPSLA-2011-SonMS #named #security #what: RoleCast: finding missing security checks when you do not know what checks are (SS, KSM, VS), pp. 1069–1084.
OOPSLA-2011-YangBFSM #matter #why: Why nothing matters: the impact of zeroing (XY, SMB, DF, JBS, KSM), pp. 307–324.
PLDI-2011-MengKM #editing #generative #program transformation: Systematic editing: generating program transformations from an example (NM, MK, KSM), pp. 329–342.
PLDI-2011-SrivastavaBMS #api #detection #implementation #multi #policy #security #using: A security policy oracle: detecting security holes using multiple API implementations (VS, MDB, KSM, VS), pp. 343–354.
POPL-2011-PrountzosMPM #analysis #graph #optimisation #parallel #source code: A shape analysis for optimizing parallel graph programs (DP, RM, KP, KSM), pp. 159–172.
PPoPP-2011-McKinley #how #parallel #question: How’s the parallel computing revolution going? (KSM), pp. 123–124.
PLDI-2010-BondCM #detection #named: PACER: proportional detection of data races (MDB, KEC, KSM), pp. 255–268.
PLDI-2010-LeeWHGM #debugging #detection #interface #named: Jinn: synthesizing dynamic bug detectors for foreign language interfaces (BL, BW, MH, RG, KSM), pp. 36–49.
PLDI-2010-SartorBFHM #array #flexibility #named: Z-rays: divide arrays and conquer speed and flexibility (JBS, SMB, DF, MH, KSM), pp. 471–482.
ASPLOS-2009-BondM: Leak pruning (MDB, KSM), pp. 277–288.
ASPLOS-2009-GebhartMCDGMRRSBKBM #evaluation: An evaluation of the TRIPS computer system (MG, BAM, KEC, JRD, PG, MM, NR, BR, AS, JHB, SWK, DB, KSM), pp. 1–12.
ISMM-2009-JumpM #analysis #metric: Dynamic shape analysis via degree metrics (MJ, KSM), pp. 119–128.
OOPSLA-2009-HaABM #concurrent #dynamic analysis #framework #hardware #manycore: A concurrent dynamic analysis framework for multicore hardware (JH, MA, SMB, KSM), pp. 155–174.
OOPSLA-2009-LeeHGM #debugging: Debug all your code: portable mixed-environment debugging (BL, MH, RG, KSM), pp. 207–226.
PLDI-2009-RoyPBMW #data flow #distributed #fine-grained #named: Laminar: practical fine-grained decentralized information flow control (IR, DEP, MDB, KSM, EW), pp. 63–74.
PLDI-2009-SubramanianHM #approach: Dynamic software updates: a VM-centric approach (SS, MWH, KSM), pp. 1–12.
ISMM-2008-SartorHM: No bit left behind: the limits of heap data compression (JBS, MH, KSM), pp. 111–120.
OOPSLA-2008-BondM #memory management: Tolerating memory leaks (MDB, KSM), pp. 109–126.
PLDI-2008-BlackburnM #garbage collection #named #performance: Immix: a mark-region garbage collector with space efficiency, fast collection, and mutator performance (SMB, KSM), pp. 22–32.
CC-2007-LeeRBM #constraints #control flow #graph #using: Correcting the Dynamic Call Graph Using Control-Flow Constraints (BL, KR, MDB, KSM), pp. 80–95.
ESEC-FSE-2007-GrechanikMP #traceability #using: Recovering and using use-case-diagram-to-source-code traceability links (MG, KSM, DEP), pp. 95–104.
OOPSLA-2007-BondM #probability: Probabilistic calling context (MDB, KSM), pp. 97–112.
OOPSLA-2007-BondNKGM #fault #null: Tracking bad apples: reporting the origin of null and undefined value errors (MDB, NN, SWK, SZG, KSM), pp. 405–422.
OOPSLA-2007-ElkarabliehKVM #named #performance #static analysis: Starc: static analysis for efficient repair of complex data (BE, SK, DV, KSM), pp. 387–404.
POPL-2007-JumpM #detection #garbage collection #memory management #named: Cork: dynamic memory leak detection for garbage-collected languages (MJ, KSM), pp. 31–38.
ASPLOS-2006-BondM #detection #encoding #memory management #named #online: Bell: bit-encoding online memory leak detection (MDB, KSM), pp. 61–72.
ASPLOS-2006-CoonsCBMK #algorithm #architecture #scheduling: A spatial path scheduling algorithm for EDGE architectures (KEC, XC, DB, KSM, SKK), pp. 129–140.
CGO-2006-SmithGMNYBMB #architecture #compilation: Compiling for EDGE Architectures (AS, JG, BAM, NN, BY, DB, KSM, JHB), pp. 185–195.
ISMM-2006-AgaramKLM #data type #memory management #performance: Decomposing memory performance: data structures and phases (KKA, SWK, CL, KSM), pp. 95–103.
ISMM-2006-HuangBGM #order #performance: Fast and efficient partial code reordering: taking advantage of dynamic recompilatior (XH, SMB, DG, KSM), pp. 184–192.
OOPSLA-2006-BlackburnGHKMBDFFGHHJLMPSVDW #analysis #benchmark #development #java #metric: The DaCapo benchmarks: java benchmarking development and analysis (SMB, RG, CH, AMK, KSM, RB, AD, DF, DF, SZG, MH, ALH, MJ, HBL, JEBM, AP, DS, TV, DvD, BW), pp. 169–190.
PLDI-2006-GuyerMF #automation #named #static analysis: Free-Me: a static analysis for automatic individual object reclamation (SZG, KSM, DF), pp. 364–375.
CGO-2005-BondM #profiling: Practical Path Profiling for Dynamic Optimizers (MDB, KSM), pp. 205–216.
CC-2004-ChowdhuryDCBM #alias #analysis #optimisation: The Limits of Alias Analysis for Scalar Optimizations (RAC, PD, BC, JHB, KSM), pp. 24–38.
ICSE-2004-BlackburnCM #garbage collection #java #performance: Oil and Water? High Performance Garbage Collection in Java with MMTk (SMB, PC, KSM), pp. 137–146.
ISMM-2004-JumpBM: Dynamic object sampling for pretenuring (MJ, SMB, KSM), pp. 152–162.
OOPSLA-2004-GuyerM #static analysis: Finding your cronies: static analysis for dynamic object colocation (SZG, KSM), pp. 237–250.
OOPSLA-2004-HuangBMMWC #garbage collection #locality: The garbage collection advantage: improving program locality (XH, SMB, KSM, JEBM, ZW, PC), pp. 69–80.
OOPSLA-2003-BlackburnM #garbage collection #performance: Ulterior reference counting: fast garbage collection without a long wait (SB, KSM), pp. 344–358.
ISMM-2002-BlackburnM: In or out?: putting write barriers in their place (SB, KSM), pp. 281–290.
OOPSLA-2002-BergerZM #memory management: Reconsidering custom memory allocation (EDB, BGZ, KSM), pp. 1–12.
PLDI-2002-BlackburnJMM #garbage collection #named: Beltway: Getting Around Garbage Collection Gridlock (SB, REJ, KSM, JEBM), pp. 153–164.
OOPSLA-2001-BlackburnSHMM #java: Pretenuring for Java (SB, SS, MH, KSM, JEBM), pp. 342–352.
PLDI-2001-BergerZM #memory management: Composing High-Performance Memory Allocators (EDB, BGZ, KSM), pp. 114–124.
ASPLOS-2000-BergerMBW #memory management #named #parallel #scalability #thread: Hoard: A Scalable Memory Allocator for Multithreaded Applications (EDB, KSM, RDB, PRW), pp. 117–128.
ISMM-2000-StefanovicMB #modelling #on the: On Models for Object Lifetimes (DS, KSM, JEBM), pp. 137–142.
SIGIR-2000-LuM #information retrieval #replication: Partial collection replication versus caching for information retrieval systems (ZL, KSM), pp. 248–255.
OOPSLA-1999-StefanovicMM #garbage collection: Age-Based Garbage Collection (DS, KSM, JEBM), pp. 370–381.
SIGIR-1999-LuM #information retrieval: Partial Replica Selection Based on Relevance for Information Retrieval (ZL, KSM), pp. 97–104.
PLDI-1998-DiwanMM #alias #analysis #type system: Type-Based Alias Analysis (AD, KSM, JEBM), pp. 106–117.
ASPLOS-1996-McKinleyT #analysis #locality: A Quantitative Analysis of Loop Nest Locality (KSM, OT), pp. 94–104.
OOPSLA-1996-DiwanMM #analysis #effectiveness #object-oriented #source code #static typing: Simple and Effective Analysis of Statically Typed Object-Oriented Programs (AD, JEBM, KSM), pp. 292–305.
SIGIR-1996-CahoonM #architecture #distributed #evaluation #information retrieval #performance: Performance Evaluation of a Distributed Architecture for Information Retrieval (BC, KSM), pp. 110–118.
PLDI-1995-ColemanM #layout #using: Tile Size Selection Using Cache Organization and Data Layout (SC, KSM), pp. 279–290.
ASPLOS-1994-CarrMT #compilation #locality #optimisation: Compiler Optimizations for Improving Data Locality (SC, KSM, CWT), pp. 252–262.
PPoPP-1993-HallHKMMOPR #case study #editing #experience #interactive #parallel #programming #using: Experiences Using the ParaScope Editor: an Interactive Parallel Programming Tool (MWH, TJH, KK, NM, KSM, JDO, MHP, GR), pp. 33–43.
OOPSLA-2017-SampsonMM #programming: Static stages for heterogeneous programming (AS, KSM, TM), p. 27.
POPL-2016-McKinley #nondeterminism #programming: Programming the world of uncertain things (keynote) (KSM), pp. 1–2.
PLDI-2018-AkramSME #garbage collection #hybrid: Write-rationing garbage collection for hybrid memories (SA, JBS, KSM, LE), pp. 62–77.
ASPLOS-2016-McKinley #nondeterminism #programming: Programming Uncertain jhings (KSM), pp. 1–2.
ASPLOS-2019-MiaoJPML #hybrid #memory management #named: StreamBox-HBM: Stream Analytics on High Bandwidth Hybrid Memory (HM, MJ, GP, KSM, FXL), pp. 167–181.
ASPLOS-2020-MaasAIJMR #c++ #memory management: Learning-based Memory Allocation for C++ Server Workloads (MM, DGA, MI, MMJ, KSM, CR), pp. 541–556.