A systematic literature review of blockchain-based applications: Current status, classification and open issues

On blockchain and its integration with IoT. Challenges and opportunities

A survey on the security of blockchain systems

Permissionless blockchains allow the execution of arbitrary programs (called smart contracts), enabling mutually untrusted entities to interact without relying on trusted third parties. Despite their potential, repeated security concerns have shaken the trust in handling billions of USD by smart contracts. To address this problem, we present Securify, a security analyzer for Ethereum smart contracts that is scalable, fully automated, and able to prove contract behaviors as safe/unsafe with respect to a given property. Securify's analysis consists of two steps. First, it symbolically analyzes the contract's dependency graph to extract precise semantic information from the code. Then, it checks compliance and violation patterns that capture sufficient conditions for proving if a property holds or not. To enable extensibility, all patterns are specified in a designated domain-specific language. Securify is publicly released, it has analyzed >18K contracts submitted by its users, and is regularly used to conduct security audits by experts. We present an extensive evaluation of Securify over real-world Ethereum smart contracts and demonstrate that it can effectively prove the correctness of smart contracts and discover critical violations.

/pdf/securify-practical-security-analysis-of-smart-contracts-3m9isitgew.pdf

Securify: Practical Security Analysis of Smart Contracts

https://repository.tudelft.nl/islandora/object/uuid%3A17c5e959-3f00-404c-b4db-748968bdcc2c/datastream/OBJ/download

Blockchain in government: Benefits and implications of distributed ledger technology for information sharing

We relate two contract models: one based on event structures and game theory, and the other one based on logic. In particular, we show that the notions of agreement and winning strategies in the game-theoretic model are related to that of provability in the logical model.

Contract agreements via logic

We establish a relation between two models of contracts: binary session types, and a model based on event structures and game-theoretic notions. In particular, we show that compliance in session types corresponds to the existence of certain winning strategies in game-based contracts.

A note on two notions of compliance

Timed session types formalise timed communication protocols between two participants at the endpoints of a session. They feature a decidable compliance relation, which generalises to the timed setting the progress-based compliance between untimed session types. We show a sound and complete technique to decide when a timed session type admits a compliant one. Then, we show how to construct the most precise session type compliant with a given one, according to the subtyping preorder induced by compliance. Decidability of subtyping follows from these results.

Tiziana Cimoli

Papers

Contract agreements via logic

A note on two notions of compliance

A note on two notions of compliance

Timed Session Types