Anton Setzer
YOU?
Author Swipe
View article: Validity, Liquidity, and Fidelity: Formal Verification for Smart Contracts in Cardano
Validity, Liquidity, and Fidelity: Formal Verification for Smart Contracts in Cardano Open
Good news for researchers in formal verification: smart contracts regularly suffer exploits such as the DAO bug, which lost the equivalent of 60 million USD on Ethereum. This makes a strong case for applying formal methods to guarantee ess…
View article: A simulator of Solidity-style smart contracts in the theorem prover Agda
A simulator of Solidity-style smart contracts in the theorem prover Agda Open
This paper extends the previous paper [6] by implementing two blockchain simulators of Solidity-style smart contracts – a simple and a complex one, using the interactive theorem prover Agda. In the previous article [6], we built a simple a…
View article: A model of Solidity-style smart contracts in the theorem prover Agda
A model of Solidity-style smart contracts in the theorem prover Agda Open
The use of smart contracts is transforming traditional industry and business practices. It enables the automatic enforcement of contractual terms without the need for a trusted third party. Smart contracts can automate a variety of transac…
View article: The extended predicative Mahlo universe in Martin-Löf type theory
The extended predicative Mahlo universe in Martin-Löf type theory Open
This paper addresses the long-standing question of the predicativity of the Mahlo universe. A solution, called the extended predicative Mahlo universe, has been proposed by Kahle and Setzer in the context of explicit mathematics. It makes …
View article: Verification of Bitcoin Script in Agda using Weakest Preconditions for Access Control
Verification of Bitcoin Script in Agda using Weakest Preconditions for Access Control Open
This paper contributes to the verification of programs written in Bitcoin's smart contract language SCRIPT in the interactive theorem prover Agda. It focuses on the security property of access control for SCRIPT programs that govern the di…
View article: JSL volume 86 issue 4 Cover and Front matter
JSL volume 86 issue 4 Cover and Front matter Open
An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
View article: JSL volume 86 issue 2 Cover and Front matter
JSL volume 86 issue 2 Cover and Front matter Open
An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
View article: JSL volume 86 issue 1 Cover and Front matter
JSL volume 86 issue 1 Cover and Front matter Open
An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
View article: Martin Hofmann’s Case for Non-Strictly Positive Data Types
Martin Hofmann’s Case for Non-Strictly Positive Data Types Open
We describe the breadth-first traversal algorithm by Martin Hofmann that uses a non-strictly positive data type and carry out a simple verification in an extensional setting. Termination is shown by implementing the algorithm in the strong…
View article: Martin Hofmann’s case for non-strictly positive 1 data types
Martin Hofmann’s case for non-strictly positive 1 data types Open
We describe the breadth-first traversal algorithm by Martin Hofmann that uses a non-strictly positive data type and carry out a simple verification in an extensional setting. Termination is shown by implementing the algorithm in the strong…
View article: Modelling Bitcoin in Agda
Modelling Bitcoin in Agda Open
We present two models of the block chain of Bitcoin in the interactive theorem prover Agda. The first one is based on a simple model of bank accounts, while having transactions with multiple inputs and outputs. The second model models tran…
View article: Defining Trace Semantics for CSP-Agda
Defining Trace Semantics for CSP-Agda Open
This article is based on the library CSP-Agda, which represents the process algebra CSP coinductively in the interactive theorem prover Agda. The intended application area of CSP-Agda is the proof of properties of safety critical systems (…
View article: Trace and Stable Failures Semantics for CSP-Agda
Trace and Stable Failures Semantics for CSP-Agda Open
CSP-Agda is a library, which formalises the process algebra CSP in the interactive theorem prover Agda using coinductive data types. In CSP-Agda, CSP processes are in monadic form, which sup- ports a modular development of processes. In th…
View article: Trace and Stable Failures Semantics for CSP-Agda
Trace and Stable Failures Semantics for CSP-Agda Open
CSP-Agda is a library, which formalises the process algebra CSP in the\ninteractive theorem prover Agda using coinductive data types. In CSP-Agda, CSP\nprocesses are in monadic form, which sup- ports a modular development of\nprocesses. In…