Search

• < Previous
• 1
• Next >

---

Honesty by Typing

Massimo Bartoletti ; Alceste Scalas ; Emilio Tuosto ; Roberto Zunino.

We propose a type system for a calculus of contracting processes. Processes can establish sessions by stipulating contracts, and then can interact either by keeping the promises made, or not. Type safety guarantees that a typeable process is honest - that is, it abides by the contracts it has&nbsp;[&hellip;]

---

Timed Session Types

Massimo Bartoletti ; Tiziana Cimoli ; Maurizio Murgia.

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&nbsp;[&hellip;]

---

Verifying liquidity of recursive Bitcoin contracts

Massimo Bartoletti ; Stefano Lande ; Maurizio Murgia ; Roberto Zunino.

Smart contracts - computer protocols that regulate the exchange of crypto-assets in trustless environments - have become popular with the spread of blockchain technologies. A landmark security property of smart contracts is liquidity: in a non-liquid contract, it may happen that some assets remain&nbsp;[&hellip;]

---

A theory of transaction parallelism in blockchains

Massimo Bartoletti ; Letterio Galletta ; Maurizio Murgia.

Decentralized blockchain platforms have enabled the secure exchange of crypto-assets without the intermediation of trusted authorities. To this purpose, these platforms rely on a peer-to-peer network of byzantine nodes, which collaboratively maintain an append-only ledger of transactions, called&nbsp;[&hellip;]

---

A theory of Automated Market Makers in DeFi

Massimo Bartoletti ; James Hsin-yu Chiang ; Alberto Lluch-Lafuente.

Automated market makers (AMMs) are one of the most prominent decentralized finance (DeFi) applications. AMMs allow users to trade different types of crypto-tokens, without the need to find a counter-party. There are several implementations and models for AMMs, featuring a variety of sophisticated&nbsp;[&hellip;]

---

Sound approximate and asymptotic probabilistic bisimulations for PCTL

Massimo Bartoletti ; Maurizio Murgia ; Roberto Zunino.

We tackle the problem of establishing the soundness of approximate bisimilarity with respect to PCTL and its relaxed semantics. To this purpose, we consider a notion of bisimilarity inspired by the one introduced by Desharnais, Laviolette, and Tracol, and parametric with respect to an approximation&nbsp;[&hellip;]

---