Mark Moir
YOU?
Author Swipe
View article: Proof Engineering with Predicate Transformer Semantics
Proof Engineering with Predicate Transformer Semantics Open
We present a lightweight, open source Agda framework for manually verifying effectful programs using predicate transformer semantics. We represent the abstract syntax trees (AST) of effectful programs with a generalized algebraic datatype …
View article: An approach to translating Haskell programs to Agda and reasoning about them
An approach to translating Haskell programs to Agda and reasoning about them Open
We are using the Agda programming language and proof assistant to formally verify the correctness of a Byzantine Fault Tolerant consensus implementation based on HotStuff / LibraBFT. The Agda implementation is a translation of our Haskell …
View article: Towards Formal Verification of HotStuff-based Byzantine Fault Tolerant Consensus in Agda: Extended Version
Towards Formal Verification of HotStuff-based Byzantine Fault Tolerant Consensus in Agda: Extended Version Open
LibraBFT is a Byzantine Fault Tolerant (BFT) consensus protocol based on HotStuff. We present an abstract model of the protocol underlying HotStuff / LibraBFT, and formal, machine-checked proofs of their core correctness (safety) property …
View article: A simple proof technique for priority-scheduled systems
A simple proof technique for priority-scheduled systems Open
A simple proof method is presented for proving invariance properties of concurrent programs in priority-scheduled systems. This method is illustrated by using it to establish the correctness of a simple wait-free consensus algorithm for pr…
View article: Wait-free algorithms for fast, long-lived renaming
Wait-free algorithms for fast, long-lived renaming Open
In the classic one-time renaming problem, processes are required to choose new names in order to reduce the size of their name space. We introduce a new, more general version of the renaming problem called long-lived renaming, in which pro…
View article: Formal Verification of Authenticated, Append-Only Skip Lists in Agda: Extended Version
Formal Verification of Authenticated, Append-Only Skip Lists in Agda: Extended Version Open
Authenticated Append-Only Skiplists (AAOSLs) enable maintenance and querying of an authenticated log (such as a blockchain) without requiring any single party to store or verify the entire log, or to trust another party regarding its conte…
View article: Formal Verification of Authenticated, Append-Only Skip Lists in Agda:\n Extended Version
Formal Verification of Authenticated, Append-Only Skip Lists in Agda:\n Extended Version Open
Authenticated Append-Only Skiplists (AAOSLs) enable maintenance and querying\nof an authenticated log (such as a blockchain) without requiring any single\nparty to store or verify the entire log, or to trust another party regarding\nits co…
View article: Enhancing Accountability and Trust in Distributed Ledgers
Enhancing Accountability and Trust in Distributed Ledgers Open
Permisionless decentralized ledgers ("blockchains") such as the one underlying the cryptocurrency Bitcoin allow anonymous participants to maintain the ledger, while avoiding control or "censorship" by any single entity. In contrast, permis…