Mike Dodds

Mike Dodds

Auto-generated profile, based on publicly available information

Mike Dodds

Galois, Inc

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 April 2018
Verified
Book Chapter
Open access
PDF file
MDMike Dodds
Mike Dodds
MBMark Batty
Mark Batty
AGAlexey Gotsman
Alexey Gotsman
A valid compiler optimisation transforms a block in a program without introducing new observable behaviours to the program as a whole. Deciding which optimisations are valid can be difficult, and depends closely on the semantic model of the programming language. Axiomatic relaxed models, such as C++11, present particular challenges for determining validity, because such models allow subtle effects of a block transformation to be observed by the rest of the program. In this paper we present a denotational theory that captures optimisation validity on an axiomatic model corresponding to a fragment of C++11. Our theory allows verifying an optimisation compositionally, by considering only the block it transforms instead of the whole program. Using this property, we realise the theory in the first push-button tool that can verify real-world optimisations under an axiomatic memory model.

11 March 2022 in IEEE Security & Privacy
Verified
Journal Article
Open access
MDMike Dodds
Mike Dodds

15 July 2021
Verified
Book Chapter
Open access
PDF file
BBBrett Boston
Brett Boston
SBSamuel Breese
Samuel Breese
JDJoey Dodds
Joey Dodds
MDMike Dodds
Mike Dodds
BHBrian Huffman
Brian Huffman
ASAndrei Stefanescu
Andrei Stefanescu
We have completed machine-assisted proofs of two highly-optimized cryptographic primitives, AES-256-GCM and SHA-384. We have verified that the implementations of these primitives, written in a mix of C and x86 assembly, are memory safe and functionally correct, by which we mean input-output equivalent to their algorithmic specifications. Our proofs were completed using SAW, a bounded cryptographic verification tool which we have extended to handle embedded x86. The code we have verified comes from AWS LibCrypto. This code is identical to BoringSSL and very similar to OpenSSL, from which it ultimately derives. We believe we are the first to formally verify these implementations, which protect the security of nearly everybody on the internet.

30 August 2023 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
RSRyan G. Scott
Ryan G. Scott
MDMike Dodds
Mike Dodds
IPIvan Perez
Ivan Perez
AGAlwyn E. Goodloe
Alwyn E. Goodloe
RDRobert Dockins
Robert Dockins
When runtime verification is used to monitor safety-critical systems, it is essential that monitoring code behaves correctly. The Copilot runtime verification framework pursues this goal by automatically generating C monitor programs from a high-level DSL embedded in Haskell. In safety-critical domains, every piece of deployed code must be accompanied by an assurance argument that is convincing to human auditors. However, it is difficult for auditors to determine with confidence that a compiled monitor cannot crash and implements the behavior required by the Copilot semantics. In this paper we describe CopilotVerifier, which runs alongside the Copilot compiler, generating a proof of correctness for the compiled output. The proof establishes that a given Copilot monitor and its compiled form produce equivalent outputs on equivalent inputs, and that they either crash in identical circumstances or cannot crash. The proof takes the form of a bisimulation broken down into a set of verification conditions. We leverage two pieces of SMT-backed technology: the Crucible symbolic execution library for LLVM and the What4 solver interface library. Our results demonstrate that dramatically increased compiler assurance can be achieved at moderate cost by building on existing tools. This paves the way to our ultimate goal of generating formal assurance arguments that are convincing to human auditors.

20 June 2024 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
IDIavor S. Diatchki
Iavor S. Diatchki
MDMike Dodds
Mike Dodds
HGHarrison Goldstein
Harrison Goldstein
BHBill Harris
Bill Harris
DHDavid A. Holland
David A. Holland
SWSimon Winwood
Simon Winwood
Despite decades of contributions to the theoretical foundations of parsing and the many tools available to aid in parser development, many security attacks in the wild still exploit parsers. The issues are myriad—flaws in memory management in contexts lacking memory safety, flaws in syntactic or semantic validation of input, and misinterpretation of hundred-page-plus standards documents. It remains challenging to build and maintain parsers for common, mature data formats. In response to these challenges, we present Daedalus, a new domain-specific language (DSL) and toolchain for writing safe parsers. Daedalus is built around functional-style parser combinators, which suit the rich data dependencies often found in complex data formats. It adds domain-specific constructs for stream manipulation, allowing the natural expression of parsing noncontiguous formats. Balancing between expressivity and domain-specific constructs lends Daedalus specifications simplicity and leaves them amenable to analysis. As a stand-alone DSL, Daedalus is able to generate safe parsers in multiple languages, currently C++ and Haskell. We have implemented 20 data formats with Daedalus, including two large, complex formats—PDF and NITF–and our evaluation shows that Daedalus parsers are concise and performant. Our experience with PDF forms our largest case study. We worked with the PDF Association to build a reference implementation, which was subject to a red-teaming exercise along with a number of other PDF parsers and was the only parser to be found free of defects.

1 September 2026 in IEEE Security & Privacy
Verified
Journal Article
Closed access
AHAndrei Homescu
Andrei Homescu
NLNicole LeGare
Nicole LeGare
SPStuart Pernsteiner
Stuart Pernsteiner
MDMike Dodds
Mike Dodds
PLPer Larsen
Per Larsen