activity
20222026
most citedEncodability and Separation for a Reflective Higher-Order Calculus

2 citations · 2 across the 5 of their papers we have counts for

collaborators

7 papers

cs.CR2026

Information Flow Control in Off-Chain Components

Stian Lybech, Eun-Young Kang, Riccardo Tonello +1

This paper develops a model of a smart-contract language for a blockchain architecture with off-chain components. Off-chain components are pieces of smart contracts that execute at…

cs.PL2025

Typing Fallback Functions: A Semantic Approach to Type Safe Smart Contracts

Stian Lybech, Daniele Gorla, Luca Aceto

This paper develops semantic typing in a smart-contract setting to ensure type safety of code that uses statically untypable language constructs, such as the fallback function. The…

cs.PL2024

Typing Composite Subjects

Luca Aceto, Daniele Gorla, Stian Lybech

Many type systems have been presented in the literature for variants of the pi-calculus, but none of them are able to handle composite subjects such as those found in the language…

cs.PL2024

Preventing Out-of-Gas Exceptions by Typing

Luca Aceto, Daniele Gorla, Stian Lybech +1

We continue the development of TinySol, a minimal object-oriented language based on Solidity, the standard smart-contract language used for the Ethereum platform. We first extend T…

cs.PL2024

A Sound Type System for Secure Currency Flow

Luca Aceto, Daniele Gorla, Stian Lybech

In this paper we focus on TinySol, a minimal calculus for Solidity smart contracts, introduced by Bartoletti et al. We start by rephrasing its syntax (to emphasise its object-orien…

cs.LO2022★ 2 cited

Encodability and Separation for a Reflective Higher-Order Calculus

Stian Lybech

The -calculus (Reflective Higher-Order Calculus) of Meredith and Radestock is a -calculus-like language with some unusual features, notably, structured names, runtime generat…

cs.LO2022

A Generic Type System for Higher-Order -calculi

Alex Rønning Bendixen, Bjarke Bredow Bojesen, Hans Hüttel +1

The Higher-Order -calculus framework (HO) is a generalisation of many first- and higher-order extensions of the -calculus. It was proposed by Parrow et al. who showed that…