| 2013 | ||
|---|---|---|
| c31 | Arun Raghavan, Laurel Emurian, Lei Shao, Marios C. Papaefthymiou, Kevin P. Pipe, Thomas F. Wenisch, Milo M. K. Martin: Computational sprinting on a hardware/software testbed. ASPLOS 2013: 155-166 | |
| 2012 | ||
| j8 | Milo M. K. Martin, Mark D. Hill, Daniel J. Sorin: Why on-chip cache coherence is here to stay. Commun. ACM 55(7): 78-89 (2012) | |
| c30 | Sela Mador-Haim, Luc Maranget, Susmit Sarkar, Kayvan Memarian, Jade Alglave, Scott Owens, Rajeev Alur, Milo M. K. Martin, Peter Sewell, Derek Williams: An Axiomatic Memory Model for POWER Multiprocessors. CAV 2012: 495-512 | |
| c29 | Arun Raghavan, Yixin Luo, Anuj Chandawalla, Marios C. Papaefthymiou, Kevin P. Pipe, Thomas F. Wenisch, Milo M. K. Martin: Computational sprinting. HPCA 2012: 249-260 | |
| c28 | Santosh Nagarakatte, Milo M. K. Martin, Steve Zdancewic: Watchdog: Hardware for safe and secure manual memory management and full memory safety. ISCA 2012: 189-200 | |
| c27 | Santosh Nagarakatte, Sebastian Burckhardt, Milo M. K. Martin, Madanlal Musuvathi: Multicore acceleration of priority-based schedulers for concurrency bug detection. PLDI 2012: 543-554 | |
| c26 | Jianzhou Zhao, Santosh Nagarakatte, Milo M. K. Martin, Steve Zdancewic: Formalizing the LLVM intermediate representation for verified program transformations. POPL 2012: 427-440 | |
| 2011 | ||
| c25 | Sela Mador-Haim, Rajeev Alur, Milo M. K. Martin: Litmus tests for comparing memory consistency models: how long do they need to be? DAC 2011: 504-509 | |
| 2010 | ||
| j7 | Arun Raghavan, Colin Blundell, Milo M. K. Martin: Token tenure and PATCH: A predictive/adaptive token-counting hybrid. TACO 7(2) (2010) | |
| c24 | Sela Mador-Haim, Rajeev Alur, Milo M. K. Martin: Generating Litmus Tests for Contrasting Memory Consistency Models. CAV 2010: 273-287 | |
| c23 | Colin Blundell, Arun Raghavan, Milo M. K. Martin: RETCON: transactional repair without replay. ISCA 2010: 258-269 | |
| c22 | Santosh Nagarakatte, Jianzhou Zhao, Milo M. K. Martin, Steve Zdancewic: CETS: compiler enforced temporal safety for C. ISMM 2010: 31-40 | |
| c21 | Matthew Hicks, Murph Finnicum, Samuel T. King, Milo M. K. Martin, Jonathan M. Smith: Overcoming an Untrusted Computing Base: Detecting and Removing Malicious Hardware Automatically. IEEE Symposium on Security and Privacy 2010: 159-172 | |
| 2009 | ||
| c20 | Colin Blundell, Milo M. K. Martin, Thomas F. Wenisch: InvisiFence: performance-transparent memory ordering in conventional multiprocessors. ISCA 2009: 233-244 | |
| c19 | Santosh Nagarakatte, Jianzhou Zhao, Milo M. K. Martin, Steve Zdancewic: SoftBound: highly compatible and complete spatial memory safety for c. PLDI 2009: 245-258 | |
| 2008 | ||
| c18 | Joe Devietti, Colin Blundell, Milo M. K. Martin, Steve Zdancewic: Hardbound: architectural support for spatial safety of the C programming language. ASPLOS 2008: 103-114 | |
| c17 | Arun Raghavan, Colin Blundell, Milo M. K. Martin: Token tenure: PATCHing token counting using directory-based cache coherence. MICRO 2008: 47-58 | |
| 2007 | ||
| j6 | Tingting Sha, Milo M. K. Martin, Amir Roth: NoSQ: Store-Load Communication without a Store Queue. IEEE Micro 27(1): 106-113 (2007) | |
| c16 | Colin Blundell, Joe Devietti, E. Christopher Lewis, Milo M. K. Martin: Making the fast case common and the uncommon case simple in unbounded transactional memory. ISCA 2007: 24-34 | |
| c15 | Sebastian Burckhardt, Rajeev Alur, Milo M. K. Martin: CheckFence: checking consistency of concurrent data types on relaxed memory models. PLDI 2007: 12-21 | |
| 2006 | ||
| j5 | Milo M. K. Martin, Colin Blundell, E. Lewis: Subtleties of Transactional Memory Atomicity Semantics. Computer Architecture Letters 5(2) (2006) | |
| c14 | Sebastian Burckhardt, Rajeev Alur, Milo M. K. Martin: Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study. CAV 2006: 489-502 | |
| c13 | Tingting Sha, Milo M. K. Martin, Amir Roth: NoSQ: Store-Load Communication without a Store Queue. MICRO 2006: 285-296 | |
| 2005 | ||
| j4 | Milo M. K. Martin, Daniel J. Sorin, Bradford M. Beckmann, Michael R. Marty, Min Xu, Alaa R. Alameldeen, Kevin E. Moore, Mark D. Hill, David A. Wood: Multifacet's general execution-driven multiprocessor simulator (GEMS) toolset. SIGARCH Computer Architecture News 33(4): 92-99 (2005) | |
| c12 | Michael R. Marty, Jesse D. Bingham, Mark D. Hill, Alan J. Hu, Milo M. K. Martin, David A. Wood: Improving Multiple-CMP Systems Using Token Coherence. HPCA 2005: 328-339 | |
| c11 | Milo M. K. Martin: Formal Verification and its Impact on the Snooping versus Directory Protocol Debate. ICCD 2005: 543-449 | |
| c10 | Tingting Sha, Milo M. K. Martin, Amir Roth: Scalable Store-Load Forwarding via Store Queue Index Prediction. MICRO 2005: 159-170 | |
| c9 | Sebastian Burckhardt, Rajeev Alur, Milo M. K. Martin: Verifying Safety of a Token Coherence Implementation by Parametric Compositional Refinement. VMCAI 2005: 130-145 | |
| 2004 | ||
| c8 | Daniel J. Sorin, Milo M. K. Martin, Mark D. Hill, David A. Wood: Using Speculation to Simplify Multiprocessor Design. IPDPS 2004 | |
| 2003 | ||
| j3 | Alaa R. Alameldeen, Milo M. K. Martin, Carl J. Mauer, Kevin E. Moore, Min Xu, Mark D. Hill, David A. Wood, Daniel J. Sorin: Simulating a $2M Commercial Server on a $2K PC. IEEE Computer 36(2): 50-57 (2003) | |
| j2 | Milo M. K. Martin, Mark D. Hill, David A. Wood: Token Coherence: A New Framework for Shared-Memory Multiprocessors. IEEE Micro 23(6): 108-116 (2003) | |
| c7 | Milo M. K. Martin, Mark D. Hill, David A. Wood: Token Coherence: Decoupling Performance and Correctness. ISCA 2003: 182-193 | |
| c6 | Milo M. K. Martin, Pacia J. Harper, Daniel J. Sorin, Mark D. Hill, David A. Wood: Using Destination-Set Prediction to Improve the Latency/Bandwidth Tradeoff in Shared-Memory Multiprocessors. ISCA 2003: 206-217 | |
| 2002 | ||
| j1 | Daniel J. Sorin, Manoj Plakal, Anne Condon, Mark D. Hill, Milo M. K. Martin, David A. Wood: Specifying and Verifying a Broadcast and a Multicast Snooping Cache Coherence Protocol. IEEE Trans. Parallel Distrib. Syst. 13(6): 556-578 (2002) | |
| c5 | Milo M. K. Martin, Daniel J. Sorin, Mark D. Hill, David A. Wood: Bandwidth Adaptive Snooping. HPCA 2002: 251-262 | |
| c4 | Daniel J. Sorin, Milo M. K. Martin, Mark D. Hill, David A. Wood: SafetyNet: Improving the Availability of Shared Memory Multiprocessors with Global Checkpoint/Recovery. ISCA 2002: 123- | |
| 2001 | ||
| c3 | Milo M. K. Martin, Daniel J. Sorin, Harold W. Cain, Mark D. Hill, Mikko H. Lipasti: Correctly implementing value prediction in microprocessors that support multithreading or multiprocessing. MICRO 2001: 328-337 | |
| 2000 | ||
| c2 | Milo M. K. Martin, Daniel J. Sorin, Anastassia Ailamaki, Alaa R. Alameldeen, Ross M. Dickson, Carl J. Mauer, Kevin E. Moore, Manoj Plakal, Mark D. Hill, David A. Wood: Timestamp snooping: an approach for extending SMPs. ASPLOS 2000: 25-36 | |
| 1997 | ||
| c1 | Milo M. K. Martin, Amir Roth, Charles N. Fischer: Exploiting Dead Value Information. MICRO 1997: 125-135 | |
Colors in the list of coauthors
Last update Sat May 25 15:02:42 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page