Zobrazeno 1 - 10
of 41
pro vyhledávání: '"MULLIGAN, DOMINIC"'
Autor:
Hsiao, Yao, Nikoleris, Nikos, Khyzha, Artem, Mulligan, Dominic P., Petri, Gustavo, Fletcher, Christopher W., Trippel, Caroline
The Check tools automate formal memory consistency model and security verification of processors by analyzing abstract models of microarchitectures, called $\mu$SPEC models. Despite the efficacy of this approach, a verification gap between $\mu$SPEC
Externí odkaz:
http://arxiv.org/abs/2409.19478
Publikováno v:
Logic Journal of the IGPL, Volume 18, Issue 6, December 2010, Pages 769-822
Nominal terms extend first-order terms with binding. They lack some properties of first- and higher-order terms: Terms must be reasoned about in a context of 'freshness assumptions'; it is not always possible to 'choose a fresh variable symbol' for a
Externí odkaz:
http://arxiv.org/abs/2312.15651
Autor:
Berger, Martin, Mulligan, Dominic P.
Whilst mathematicians assume classical reasoning principles by default they often context switch when working, restricting themselves to various forms of subclassical reasoning. This pattern is especially common amongst logicians and set theorists, b
Externí odkaz:
http://arxiv.org/abs/2302.10137
Autor:
Mulligan, Dominic P., Spinale, Nick
Interactive theorem proving software is typically designed around a trusted proof-checking kernel, the sole system component capable of authenticating theorems. Untrusted automation procedures reside outside of the kernel, and drive it to deduce new
Externí odkaz:
http://arxiv.org/abs/2205.03332
Autor:
Brossard, Mathias, Bryant, Guilhem, Gaabouri, Basma El, Fan, Xinxin, Ferreira, Alexandre, Grimley-Evans, Edmund, Haster, Christopher, Johnson, Evan, Miller, Derek, Mo, Fan, Mulligan, Dominic P., Spinale, Nick, van Hensbergen, Eric, Vincent, Hugo J. M., Xiong, Shale
Sensitive computations are now routinely delegated to third-parties. In response, Confidential Computing technologies are being introduced to microprocessors, offering a protected processing environment, which we generically call an isolate, providin
Externí odkaz:
http://arxiv.org/abs/2205.03322
We introduce OpSets, an executable framework for specifying and reasoning about the semantics of replicated datatypes that provide eventual consistency in a distributed system, and for mechanically verifying algorithms that implement these datatypes.
Externí odkaz:
http://arxiv.org/abs/1805.04263
Publikováno v:
Proceedings of the ACM on Programming Languages (PACMPL), Vol. 1, No. OOPSLA, Article 109, October 2017
Data replication is used in distributed systems to maintain up-to-date copies of shared data across multiple computers in a network. However, despite decades of research, algorithms for achieving consistency in replicated systems are still poorly und
Externí odkaz:
http://arxiv.org/abs/1707.01747
Autor:
Mulligan, Dominic Phillip
This thesis studies two major extensions of nominal terms. In particular, we study an extension with -abstraction over nominal unknowns and atoms, and an extension with an arguably better theory of freshness and -equivalence. Nominal terms possess tw
Externí odkaz:
http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.575226
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
EPTCS 71, 2011, pp. 58-75
We investigate a class of nominal algebraic Henkin-style models for the simply typed lambda-calculus in which variables map to names in the denotation and lambda-abstraction maps to a (non-functional) name-abstraction operation. The resulting denotat
Externí odkaz:
http://arxiv.org/abs/1111.0089