default search action
Milo M. K. Martin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c41]Dan Gibson, Hema Hariharan, Eric Lance, Moray McLaren, Behnam Montazeri, Arjun Singh, Stephen Wang, Hassan M. G. Wassel, Zhehua Wu, Sunghwan Yoo, Raghuraman Balasubramanian, Prashant Chandra, Michael Cutforth, Peter Cuy, David Decotigny, Rakesh Gautam, Alex Iriza, Milo M. K. Martin, Rick Roy, Zuowei Shen, Ming Tan, Ye Tang, Monica Wong-Chan, Joe Zbiciak, Amin Vahdat:
Aquila: A unified, low-latency fabric for datacenter networks. NSDI 2022: 1249-1266 - 2021
- [c40]Arjun Singhvi, Aditya Akella, Maggie Anderson, Rob Cauble, Harshad Deshmukh, Dan Gibson, Milo M. K. Martin, Amanda Strominger, Thomas F. Wenisch, Amin Vahdat:
CliqueMap: productionizing an RMA-based distributed caching system. SIGCOMM 2021: 93-105 - 2020
- [c39]Arjun Singhvi, Aditya Akella, Dan Gibson, Thomas F. Wenisch, Monica Wong-Chan, Sean Clark, Milo M. K. Martin, Moray McLaren, Prashant Chandra, Rob Cauble, Hassan M. G. Wassel, Behnam Montazeri, Simon L. Sabato, Joel Scherpelz, Amin Vahdat:
1RMA: Re-envisioning Remote Memory Access for Multi-tenant Datacenters. SIGCOMM 2020: 708-721
2010 – 2019
- 2016
- [j13]Milo M. K. Martin, Daniel J. Sorin:
Top Picks from the 2015 Computer Architecture Conferences. IEEE Micro 36(3): 6-9 (2016) - 2015
- [c38]Santosh Nagarakatte, Milo M. K. Martin, Steve Zdancewic:
Everything You Want to Know About Pointer-Based Checking. SNAPL 2015: 190-208 - [p1]Rajeev Alur, Rastislav Bodík, Eric Dallal, Dana Fisman
, Pranav Garg, Garvit Juniwal, Hadas Kress-Gazit, P. Madhusudan, Milo M. K. Martin, Mukund Raghothaman
Syntax-Guided Synthesis. Dependable Software Systems Engineering 2015: 1-25 - 2014
- [c37]Santosh Nagarakatte, Milo M. K. Martin, Steve Zdancewic:
WatchdogLite: Hardware-Accelerated Compiler-Based Pointer Checking. CGO 2014: 175 - [c36]Rajeev Alur, Milo M. K. Martin, Mukund Raghothaman
Synthesizing Finite-State Protocols from Scenarios and Requirements. Haifa Verification Conference 2014: 75-91 - [i1]Rajeev Alur, Milo M. K. Martin, Mukund Raghothaman, Christos Stergiou, Stavros Tripakis, Abhishek Udupa:
Synthesizing Finite-state Protocols from Scenarios and Requirements. CoRR abs/1402.7150 (2014) - 2013
- [j12]Arun Raghavan, Yixin Luo, Anuj Chandawalla, Marios C. Papaefthymiou, Kevin P. Pipe, Thomas F. Wenisch, Milo M. K. Martin:
Designing for Responsiveness with Computational Sprinting. IEEE Micro 33(3): 8-15 (2013) - [j11]Santosh Nagarakatte
Hardware-Enforced Comprehensive Memory Safety. IEEE Micro 33(3): 38-47 (2013) - [j10]Arun Raghavan, Laurel Emurian, Lei Shao, Marios C. Papaefthymiou, Kevin P. Pipe, Thomas F. Wenisch, Milo M. K. Martin:
Utilizing Dark Silicon to Save Energy with Computational Sprinting. IEEE Micro 33(5): 20-28 (2013) - [c35]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 - [c34]Rajeev Alur, Rastislav Bodík, Garvit Juniwal, Milo M. K. Martin, Mukund Raghothaman, Sanjit A. Seshia, Rishabh Singh, Armando Solar-Lezama
Syntax-guided synthesis. FMCAD 2013: 1-8 - [c33]Christian DeLozier
Ironclad C++: a library-augmented type-safe subset of c++. OOPSLA 2013: 287-304 - [c32]Jianzhou Zhao, Santosh Nagarakatte
Formal verification of SSA-based optimizations for LLVM. PLDI 2013: 175-186 - [c31]Abhishek Udupa, Arun Raghavan, Jyotirmoy V. Deshmukh, Sela Mador-Haim, Milo M. K. Martin, Rajeev Alur:
TRANSIT: specifying protocols with concolic snippets. PLDI 2013: 287-296 - 2012
- [j9]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
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
Watchdog: Hardware for safe and secure manual memory management and full memory safety. ISCA 2012: 189-200 - [c27]Santosh Nagarakatte
Multicore acceleration of priority-based schedulers for concurrency bug detection. PLDI 2012: 543-554 - [c26]Jianzhou Zhao, Santosh Nagarakatte
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
- [j8]Arun Raghavan, Colin Blundell, Milo M. K. Martin:
Token tenure and PATCH: A predictive/adaptive token-counting hybrid. ACM Trans. Archit. Code Optim. 7(2): 6:1-6:31 (2010) - [j7]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. login Usenix Mag. 35(6) (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
CETS: compiler enforced temporal safety for C. ISMM 2010: 31-40 - [c21]Matthew Hicks
Overcoming an Untrusted Computing Base: Detecting and Removing Malicious Hardware Automatically. IEEE Symposium on Security and Privacy 2010: 159-172
2000 – 2009
- 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
SoftBound: highly compatible and complete spatial memory safety for c. PLDI 2009: 245-258 - 2008
- [c18]Joe Devietti
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 Christopher Lewis:
Subtleties of Transactional Memory Atomicity Semantics. IEEE Comput. Archit. Lett. 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 Comput. Archit. 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. 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 Distributed 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-134 - 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
1990 – 1999
- 1997
- [c1]Milo M. K. Martin, Amir Roth, Charles N. Fischer:
Exploiting Dead Value Information. MICRO 1997: 125-135
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-09 22:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: