D
Dominic P. Mulligan
Researcher at University of Cambridge
Publications - 30
Citations - 405
Dominic P. Mulligan is an academic researcher from University of Cambridge. The author has contributed to research in topics: Computer science & HOL. The author has an hindex of 10, co-authored 25 publications receiving 305 citations. Previous affiliations of Dominic P. Mulligan include École Polytechnique & University of Bologna.
Papers
More filters
Proceedings ArticleDOI
Lem: reusable engineering of real-world semantics
TL;DR: Lem is introduced, a language for engineering reusable large-scale semantic models, which takes inspiration both from functional programming languages and from proof assistants, and Lem definitions are translatable into OCaml for testing, Coq, HOL4, and Isabelle/HOL for proof, and LaTeX and HTML for presentation.
Journal ArticleDOI
Verifying strong eventual consistency in distributed systems
TL;DR: In this paper, the authors focus on the correctness of Conflict-free Replicated Data Types (CRDTs), a class of algorithm that provides strong eventual consistency guarantees for replicated data.
Proceedings ArticleDOI
An integrated concurrency and core-ISA architectural envelope definition, and test oracle, for IBM POWER multiprocessors
Kathryn E. Gray,Gabriel Kerneis,Dominic P. Mulligan,Christopher Pulte,Susmit Sarkar,Peter Sewell +5 more
TL;DR: This paper shows how a precise architectural envelope model for weakly consistent multiprocessor architectures can be defined, taking IBM POWER as an example, and is expressed in a mathematically rigorous language that can be automatically translated to an executable test-oracle tool.
Journal ArticleDOI
Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques
TL;DR: It is proved that expressivity is not lost moving to the permissive case and the relation between permissive nominal unification and higher-order pattern unification is investigated, which shows how to translate permitting nominal unification problems and solutions in a sound, complete, and optimal manner.
Book ChapterDOI
Certified Complexity (CerCo)
Roberto M. Amadio,Nicolas Ayache,Nicolas Ayache,François Bobot,François Bobot,Jaap Boender,Brian Campbell,Ilias Garnier,Antoine Madet,James McKinna,Dominic P. Mulligan,Mauro Piccolo,Randy Pollack,Yann Régis-Gianas,Yann Régis-Gianas,Claudio Sacerdoti Coen,Ian Stark,Paolo Tranquilli +17 more
TL;DR: The main achievement is the development of a technique for analysing non-functional properties of programs at the source level with little or no loss of accuracy and a small trusted code base.