default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDominic P. Mulligan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Mathias Brossard
, Guilhem Bryant, Basma El Gaabouri, Xinxin Fan, Alexandre Ferreira, Edmund Grimley-Evans, Christopher Haster, Evan Johnson, Derek Miller, Fan Mo, Dominic P. Mulligan, Nick Spinale, Eric Van Hensbergen, Hugo J. M. Vincent, Shale Xiong:
Private Delegated Computations Using Strong Isolation. IEEE Trans. Emerg. Top. Comput. 12(1): 386-398 (2024)- [i7]Yao Hsiao, Nikos Nikoleris, Artem Khyzha, Dominic P. Mulligan, Gustavo Petri, Christopher W. Fletcher, Caroline Trippel:
RTL2MμPATH: Multi-μPATH Synthesis with Applications to Hardware Security Verification. CoRR abs/2409.19478 (2024) - 2023
- [j9]Anthony C. J. Fox, Gareth Stockwell, Shale Xiong, Hanno Becker, Dominic P. Mulligan, Gustavo Petri, Nathan Chong:
A Verification Methodology for the Arm® Confidential Computing Architecture: From a Secure Specification to Safe Implementations. Proc. ACM Program. Lang. 7(OOPSLA1): 376-405 (2023) - [c16]Mathias Brossard, Guilhem Bryant, Xinxin Fan, Alexandre Ferreira, Edmund Grimley-Evans, Christopher Haster, Derek Miller, Dominic P. Mulligan, Hugo J. M. Vincent, Shale Xiong, Lei Xu:
Privacy-Preserving Object Detection with Veracruz. PerCom Workshops 2023: 322-324 - [i6]Martin Berger, Dominic P. Mulligan:
A modest proposal: explicit support for foundational pluralism. CoRR abs/2302.10137 (2023) - [i5]Gilles Dowek, Murdoch James Gabbay, Dominic P. Mulligan:
Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques. CoRR abs/2312.15651 (2023) - 2022
- [j8]Martin Kleppmann, Dominic P. Mulligan, Victor B. F. Gomes, Alastair R. Beresford:
A Highly-Available Move Operation for Replicated Trees. IEEE Trans. Parallel Distributed Syst. 33(7): 1711-1724 (2022) - [c15]Dominic P. Mulligan:
All Watched Over by Machines of Loving Grace. TYPES 2022: 1:1-1:23 - [i4]Mathias Brossard, Guilhem Bryant, Basma El Gaabouri, Xinxin Fan, Alexandre Ferreira, Edmund Grimley-Evans, Christopher Haster, Evan Johnson, Derek Miller, Fan Mo, Dominic P. Mulligan, Nick Spinale, Eric Van Hensbergen, Hugo J. M. Vincent, Shale Xiong:
Private delegated computations using strong isolation. CoRR abs/2205.03322 (2022) - [i3]Dominic P. Mulligan, Nick Spinale:
The Supervisionary proof-checking kernel (or: a work-in-progress towards proof generating code). CoRR abs/2205.03332 (2022) - 2021
- [c14]Yao Hsiao, Dominic P. Mulligan, Nikos Nikoleris, Gustavo Petri, Caroline Trippel:
Synthesizing Formal Models of Hardware from RTL for Efficient Verification of Memory Model Implementations. MICRO 2021: 679-694 - [c13]Dominic P. Mulligan, Gustavo Petri, Nick Spinale, Gareth Stockwell, Hugo J. M. Vincent:
Confidential Computing - a brave new world. SEED 2021: 132-138
2010 – 2019
- 2019
- [c12]Martin Kleppmann, Victor B. F. Gomes, Dominic P. Mulligan, Alastair R. Beresford:
Interleaving anomalies in collaborative text editors. PaPoC@EuroSys 2019: 6:1-6:7 - 2018
- [j7]Martin Kleppmann, Victor B. F. Gomes, Dominic P. Mulligan, Alastair R. Beresford:
OpSets: Sequential Specifications for Replicated Datatypes. Arch. Formal Proofs 2018 (2018) - [i2]Martin Kleppmann, Victor B. F. Gomes, Dominic P. Mulligan, Alastair R. Beresford:
OpSets: Sequential Specifications for Replicated Datatypes (Extended Version). CoRR abs/1805.04263 (2018) - 2017
- [j6]Victor B. F. Gomes, Martin Kleppmann, Dominic P. Mulligan, Alastair R. Beresford:
A framework for establishing Strong Eventual Consistency for Conflict-free Replicated Datatypes. Arch. Formal Proofs 2017 (2017) - [j5]Cristina Matache, Victor B. F. Gomes, Dominic P. Mulligan:
The LambdaMu-calculus. Arch. Formal Proofs 2017 (2017) - [j4]Victor B. F. Gomes, Martin Kleppmann, Dominic P. Mulligan, Alastair R. Beresford:
Verifying strong eventual consistency in distributed systems. Proc. ACM Program. Lang. 1(OOPSLA): 109:1-109:28 (2017) - [c11]Cristina Matache, Victor B. F. Gomes, Dominic P. Mulligan:
Programming and Proving with Classical Types. APLAS 2017: 215-234 - [i1]Victor B. F. Gomes, Martin Kleppmann, Dominic P. Mulligan, Alastair R. Beresford:
Verifying Strong Eventual Consistency in Distributed Systems. CoRR abs/1707.01747 (2017) - 2016
- [c10]Stephen Kell, Dominic P. Mulligan, Peter Sewell:
The missing link: explaining ELF static linking, semantically. OOPSLA 2016: 607-623 - 2015
- [c9]Kathryn E. Gray, Gabriel Kerneis, Dominic P. Mulligan, Christopher Pulte, Susmit Sarkar, Peter Sewell:
An integrated concurrency and core-ISA architectural envelope definition, and test oracle, for IBM POWER multiprocessors. MICRO 2015: 635-646 - 2014
- [c8]Dominic P. Mulligan, Scott Owens, Kathryn E. Gray, Tom Ridge, Peter Sewell:
Lem: reusable engineering of real-world semantics. ICFP 2014: 175-188 - 2013
- [c7]Roberto M. Amadio, Nicholas Ayache, François Bobot, Jaap Boender, Brian Campbell, Ilias Garnier, Antoine Madet, James McKinna, Dominic P. Mulligan, Mauro Piccolo, Randy Pollack, Yann Régis-Gianas, Claudio Sacerdoti Coen, Ian Stark, Paolo Tranquilli:
Certified Complexity (CerCo). FOPARA 2013: 1-18 - 2012
- [j3]Murdoch James Gabbay, Dominic P. Mulligan:
Corrigendum to "Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms" [Inf.Comput.208(3)(2010) 230-258]. Inf. Comput. 212: 119 (2012) - [c6]Dominic P. Mulligan, Claudio Sacerdoti Coen:
On the Correctness of an Optimising Assembler for the Intel MCS-51 Microprocessor. CPP 2012: 43-59 - 2011
- [b1]Dominic P. Mulligan:
Extensions of nominal terms. Heriot-Watt University, Edinburgh, UK, 2011 - [c5]Murdoch James Gabbay, Dominic P. Mulligan:
Nominal Henkin Semantics: simply-typed lambda-calculus models in nominal sets. LFMTP 2011: 58-75 - [c4]R. Armadio, Andrea Asperti, Nicholas Ayache, Brian Campbell, Dominic P. Mulligan, Randy Pollack, Yann Régis-Gianas, Claudio Sacerdoti Coen, Ian Stark:
Certified Complexity. FET 2011: 175-177 - 2010
- [j2]Murdoch James Gabbay, Dominic P. Mulligan:
Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms. Inf. Comput. 208(3): 230-258 (2010) - [j1]Gilles Dowek, Murdoch James Gabbay, Dominic P. Mulligan:
Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques. Log. J. IGPL 18(6): 769-822 (2010)
2000 – 2009
- 2009
- [c3]Murdoch James Gabbay, Dominic P. Mulligan:
Universal algebra over lambda-terms and nominal terms: the connection in logic between nominal techniques and higher-order variables. LFMTP 2009: 64-73 - 2008
- [c2]Murdoch Gabbay, Dominic P. Mulligan:
One-and-a-Halfth Order Terms: Curry-Howard and Incomplete Derivations. WoLLIC 2008: 179-193 - [c1]Murdoch James Gabbay, Dominic P. Mulligan:
Two-level Lambda-calculus. WFLP 2008: 107-129
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-18 20:31 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:
