Travelled to:
1 × Canada
1 × China
1 × France
1 × Ireland
1 × United Kingdom
14 × USA
Collaborated with:
R.Alur S.Nagarakatte S.Zdancewic S.Burckhardt J.Zhao S.Mador-Haim M.D.Hill D.A.Wood A.Raghavan D.J.Sorin M.C.Papaefthymiou K.P.Pipe T.F.Wenisch M.Musuvathi J.Devietti C.Blundell C.DeLozier R.A.Eisenberg P.Osera A.Udupa J.V.Deshmukh M.R.Marty J.D.Bingham A.J.Hu L.Emurian L.Shao Y.Luo A.Chandawalla L.Maranget S.Sarkar K.Memarian J.Alglave S.Owens P.Sewell D.Williams A.Ailamaki A.R.Alameldeen R.M.Dickson C.J.Mauer K.E.Moore M.Plakal
Talks about:
memori (6) model (6) safeti (4) check (4) consist (3) concurr (3) type (3) base (3) spatial (2) program (2)
Person: Milo M. K. Martin
DBLP: Martin:Milo_M=_K=
Contributed to:
Wrote 20 papers:
- CGO-2014-NagarakatteMZ #named #pointer
- WatchdogLite: Hardware-Accelerated Compiler-Based Pointer Checking (SN, MMKM, SZ), p. 175.
- ASPLOS-2013-RaghavanESPPWM #hardware #testing
- Computational sprinting on a hardware/software testbed (AR, LE, LS, MCP, KPP, TFW, MMKM), pp. 155–166.
- OOPSLA-2013-DeLozierENOMZ #c++ #set #type safety
- Ironclad C++: a library-augmented type-safe subset of c++ (CD, RAE, SN, PMO, MMKM, SZ), pp. 287–304.
- PLDI-2013-UdupaRDMMA #named #protocol #specification
- TRANSIT: specifying protocols with concolic snippets (AU, AR, JVD, SMH, MMKM, RA), pp. 287–296.
- PLDI-2013-ZhaoNMZ #optimisation #verification
- Formal verification of SSA-based optimizations for LLVM (JZ, SN, MMKM, SZ), pp. 175–186.
- CAV-2012-Mador-HaimMSMAOAMSW #axiom #memory management #multi
- An Axiomatic Memory Model for POWER Multiprocessors (SMH, LM, SS, KM, JA, SO, RA, MMKM, PS, DW), pp. 495–512.
- HPCA-2012-RaghavanLCPPWM
- Computational sprinting (AR, YL, AC, MCP, KPP, TFW, MMKM), pp. 249–260.
- PLDI-2012-NagarakatteBMM #concurrent #debugging #detection #manycore
- Multicore acceleration of priority-based schedulers for concurrency bug detection (SN, SB, MMKM, MM), pp. 543–554.
- POPL-2012-ZhaoNMZ #formal method #program transformation #representation
- Formalizing the LLVM intermediate representation for verified program transformations (JZ, SN, MMKM, SZ), pp. 427–440.
- DAC-2011-Mador-HaimAM #consistency #how #memory management #modelling #question #testing
- Litmus tests for comparing memory consistency models: how long do they need to be? (SMH, RA, MMKM), pp. 504–509.
- CAV-2010-Mador-HaimAM #consistency #generative #memory management #modelling #testing
- Generating Litmus Tests for Contrasting Memory Consistency Models (SMH, RA, MMKM), pp. 273–287.
- ISMM-2010-NagarakatteZMZ #c #compilation #named #safety
- CETS: compiler enforced temporal safety for C (SN, JZ, MMKM, SZ), pp. 31–40.
- PLDI-2009-NagarakatteZMZ #bound #c #memory management #named #safety
- SoftBound: highly compatible and complete spatial memory safety for c (SN, JZ, MMKM, SZ), pp. 245–258.
- ASPLOS-2008-DeviettiBMZ #architecture #bound #c #named #programming language #safety
- Hardbound: architectural support for spatial safety of the C programming language (JD, CB, MMKM, SZ), pp. 103–114.
- PLDI-2007-BurckhardtAM #concurrent #consistency #data type #memory management #modelling #named
- CheckFence: checking consistency of concurrent data types on relaxed memory models (SB, RA, MMKM), pp. 12–21.
- CAV-2006-BurckhardtAM #bound #case study #concurrent #data type #memory management #model checking #modelling
- Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study (SB, RA, MMKM), pp. 489–502.
- HPCA-2005-MartyBHHMW #multi #using
- Improving Multiple-CMP Systems Using Token Coherence (MRM, JDB, MDH, AJH, MMKM, DAW), pp. 328–339.
- VMCAI-2005-BurckhardtAM #composition #implementation #parametricity #refinement #safety #verification
- Verifying Safety of a Token Coherence Implementation by Parametric Compositional Refinement (SB, RA, MMKM), pp. 130–145.
- HPCA-2002-MartinSHW #adaptation
- Bandwidth Adaptive Snooping (MMKM, DJS, MDH, DAW), pp. 251–262.
- ASPLOS-2000-MartinSAADMMPHW #approach
- Timestamp snooping: an approach for extending SMPs (MMKM, DJS, AA, ARA, RMD, CJM, KEM, MP, MDH, DAW), pp. 25–36.