default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMike Dodds
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Iavor S. Diatchki
, Mike Dodds, Harrison Goldstein, Bill Harris, David A. Holland, Benoît Razet, Cole Schlesinger, Simon Winwood:
Daedalus: Safer Document Parsing. Proc. ACM Program. Lang. 8(PLDI): 816-840 (2024)- [c25]Mark Tullsen, Sam Cowger, Mike Dodds, Peter Wyatt:
Research Report: An Optim (l) Approach to Parsing Random-Access Formats. SP (Workshops) 2024: 192-199 - [i5]Ryan G. Scott, Brett Boston, Benjamin Davis, Iavor S. Diatchki, Mike Dodds, Joe Hendrix, Daniel Matichuk, Kevin Quick, Tristan Ravitch, Valentin Robert, Benjamin Selfridge, Andrei Stefanescu, Daniel Wagner, Simon Winwood:
Macaw: A Machine Code Toolbox for the Busy Binary Analyst. CoRR abs/2407.06375 (2024) - 2023
- [j5]Ryan G. Scott, Mike Dodds, Ivan Perez, Alwyn E. Goodloe, Robert Dockins:
Trustworthy Runtime Verification via Bisimulation (Experience Report). Proc. ACM Program. Lang. 7(ICFP): 305-321 (2023) - 2022
- [j4]Mike Dodds:
Formally Verifying Industry Cryptography. IEEE Secur. Priv. 20(3): 65-70 (2022) - 2021
- [c24]Brett Boston, Samuel Breese, Joey Dodds, Mike Dodds, Brian Huffman, Adam Petcher, Andrei Stefanescu:
Verified Cryptographic Code for Everybody. CAV (1) 2021: 645-668 - 2020
- [c23]Giuliano Losa, Mike Dodds:
On the Formal Verification of the Stellar Consensus Protocol. FMBC@CAV 2020: 9:1-9:9 - [c22]Aaron Tomb, Stuart Pernsteiner, Mike Dodds:
Symbolic Testing for C and Rust. SecDev 2020: 33
2010 – 2019
- 2018
- [c21]Mike Dodds, Mark Batty, Alexey Gotsman:
Compositional Verification of Compiler Optimisations on Relaxed Memory. ESOP 2018: 1027-1055 - [c20]Mike Dodds, Stephen Magill, Aaron Tomb:
Tutorial: Continuous Verification of Critical Software. SecDev 2018: 128-129 - [i4]Mike Dodds, Mark Batty, Alexey Gotsman:
Compositional Verification of Compiler Optimisations on Relaxed Memory. CoRR abs/1802.05918 (2018) - 2017
- [c19]Matt Windsor, Mike Dodds, Ben Simner, Matthew J. Parkinson:
Starling: Lightweight Concurrency Verification with Views. CAV (1) 2017: 544-569 - [c18]Artem Khyzha, Mike Dodds, Alexey Gotsman, Matthew J. Parkinson:
Proving Linearizability Using Partial Orders. ESOP 2017: 639-667 - [i3]Artem Khyzha, Mike Dodds, Alexey Gotsman, Matthew J. Parkinson:
Proving Linearizability Using Partial Orders (Extended Version). CoRR abs/1701.05463 (2017) - 2016
- [j3]Mike Dodds, Suresh Jagannathan, Matthew J. Parkinson, Kasper Svendsen, Lars Birkedal:
Verifying Custom Synchronization Constructs Using Higher-Order Separation Logic. ACM Trans. Program. Lang. Syst. 38(2): 4:1-4:72 (2016) - 2015
- [c17]Mike Dodds, Andreas Haas, Christoph M. Kirsch:
A Scalable, Correct Time-Stamped Stack. POPL 2015: 233-246 - [c16]Jan Tobias Mühlberg, David H. White, Mike Dodds, Gerald Lüttgen, Frank Piessens:
Learning Assertions to Verify Linked-List Programs. SEFM 2015: 37-52 - [i2]Matko Botincan, Mike Dodds, Stephen Magill:
Refining Existential Properties in Separation Logic Analyses. CoRR abs/1504.08309 (2015) - 2014
- [c15]Christopher M. Poskitt, Mike Dodds, Richard F. Paige, Arend Rensink:
Towards Rigorously Faking Bidirectional Model Transformations. AMT@MoDELS 2014: 70-75 - 2013
- [j2]Matko Botincan, Mike Dodds, Suresh Jagannathan:
Proof-Directed Parallelization Synthesis by Separation Logic. ACM Trans. Program. Lang. Syst. 35(2): 8:1-8:60 (2013) - [c14]John Wickerson, Mike Dodds, Matthew J. Parkinson:
Ribbon Proofs for Separation Logic. ESOP 2013: 189-208 - [c13]Mark Batty, Mike Dodds, Alexey Gotsman:
Library abstraction for C/C++ concurrency. POPL 2013: 235-248 - [i1]Mike Dodds, Mark Batty, Alexey Gotsman:
C/C++ Causal Cycles Confound Compositionality. Tiny Trans. Comput. Sci. 2 (2013) - 2012
- [c12]Matko Botincan, Mike Dodds, Suresh Jagannathan:
Resource-sensitive synchronization inference by abduction. POPL 2012: 309-322 - 2011
- [c11]Matko Botincan, Mike Dodds, Alastair F. Donaldson, Matthew J. Parkinson:
Safe asynchronous multicore memory operations. ASE 2011: 153-162 - [c10]Pedro da Rocha Pinto, Thomas Dinsdale-Young, Mike Dodds, Philippa Gardner, Mark J. Wheelhouse:
A simple abstraction for complex concurrent indexes. OOPSLA 2011: 845-864 - [c9]Mike Dodds, Suresh Jagannathan, Matthew J. Parkinson:
Modular reasoning for deterministic parallelism. POPL 2011: 259-270 - [c8]Matko Botincan, Mike Dodds, Alastair F. Donaldson, Matthew J. Parkinson:
Automatic safety proofs for asynchronous memory operations. PPoPP 2011: 313-314 - [c7]Daiva Naudziuniene, Matko Botincan, Dino Distefano, Mike Dodds, Radu Grigore, Matthew J. Parkinson:
jStar-eclipse: an IDE for automated verification of Java programs. SIGSOFT FSE 2011: 428-431 - 2010
- [c6]Thomas Dinsdale-Young, Mike Dodds, Philippa Gardner, Matthew J. Parkinson, Viktor Vafeiadis:
Concurrent Abstract Predicates. ECOOP 2010: 504-528 - [c5]John Wickerson, Mike Dodds, Matthew J. Parkinson:
Explicit Stabilisation for Modular Rely-Guarantee Reasoning. ESOP 2010: 610-629
2000 – 2009
- 2009
- [c4]Mike Dodds, Xinyu Feng, Matthew J. Parkinson, Viktor Vafeiadis:
Deny-Guarantee Reasoning. ESOP 2009: 363-377 - 2008
- [b1]Mike Dodds:
Graph transformation and pointer structures. University of York, UK, 2008 - [j1]Mike Dodds, Detlef Plump:
From Hyperedge Replacement to Separation Logic and Back. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 16 (2008) - [c3]Mike Dodds:
From Separation Logic to Hyperedge Replacement and Back. ICGT 2008: 484-486 - 2006
- [c2]Mike Dodds, Detlef Plump:
Graph Transformation in Constant Time. ICGT 2006: 367-382 - 2005
- [c1]Mike Dodds, Detlef Plump:
Extending C for Checking Shape Safety. GT-VC@CONCUR 2005: 95-112
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-10-07 21:18 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:
