3 citations · 4 across the 4 of their papers we have counts for
10 papers
HELMHOLTZ: A Verifier for Tezos Smart Contracts Based on Refinement Types
Yuki Nishida, Hiromasa Saito, Ran Chen +4
A smart contract is a program executed on a blockchain, based on which many cryptocurrencies are implemented, and is being used for automating transactions. Due to the large amount…
Verification of a Merkle Patricia Tree Library Using F*
Sota Sato, Ryotaro Banno, Jun Furuse +2
A Merkle tree is a data structure for representing a key-value store as a tree. Each node of a Merkle tree is equipped with a hash value computed from those of their descendants. A…
Compilation of Coordinated Choice
Yuki Nishida, Atsushi Igarashi
Recently, we have proposed coordinated choices, which are nondeterministic choices equipped with names. The main characteristic of coordinated choices is that they synchronize nond…
Gradual Typing for Extensibility by Rows
Taro Sekiyama, Atsushi Igarashi
This work studies gradual typing for row types and row polymorphism. Key ingredients in this work are the dynamic row type, which represents a statically unknown part of a row, and…
Manifest Contracts with Intersection Types
Yuki Nishida, Atsushi Igarashi
We present a manifest contract system PCFvH with intersection types. A manifest contract system is a typed functional calculus in which software contracts are integrated into a…
Space-Efficient Gradual Typing in Coercion-Passing Style
Yuya Tsuda, Atsushi Igarashi, Tomoya Tabuchi
Herman et al. pointed out that the insertion of run-time checks into a gradually typed program could hamper tail-call optimization and, as a result, worsen the space complexity of…