Saved in:
Bibliographic Details
Main Authors: Afonso, Joao, Selabi, Elvis Konjoh, Murgia, Maurizio, Ravara, Antonio, Tuosto, Emilio
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2404.19523
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866910428749103104
author Afonso, Joao
Selabi, Elvis Konjoh
Murgia, Maurizio
Ravara, Antonio
Tuosto, Emilio
author_facet Afonso, Joao
Selabi, Elvis Konjoh
Murgia, Maurizio
Ravara, Antonio
Tuosto, Emilio
contents We propose TRAC, a tool for the specification and verification of coordinated multiparty distributed systems. Relying on finite-state machines (FSMs) where transition labels look like Hoare triples, \thetool can specify the coordination of the participants of a distributed protocol for instance an execution model akin blockchain smart contracts (SCs). In fact, the transitions of our FSMs yield guards, and assignments over data variables, and with participants binders. The latter allow us to model scenarios with an unbounded number of participants which can vary at run-time. We introduce a notion of well-formedness to rule out meaningless or problematic specifications. This notion is verified with TRAC and demonstrated on several case studies borrowed from the smart contracts domain. Then, we evaluate the performance of TRAC using a set of randomised examples, studying the correlations between the features supported and the time taken to decide well-formedness.
format Preprint
id arxiv_https___arxiv_org_abs_2404_19523
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle TRAC: a tool for data-aware coordination (with an application to smart contracts)
Afonso, Joao
Selabi, Elvis Konjoh
Murgia, Maurizio
Ravara, Antonio
Tuosto, Emilio
Logic in Computer Science
We propose TRAC, a tool for the specification and verification of coordinated multiparty distributed systems. Relying on finite-state machines (FSMs) where transition labels look like Hoare triples, \thetool can specify the coordination of the participants of a distributed protocol for instance an execution model akin blockchain smart contracts (SCs). In fact, the transitions of our FSMs yield guards, and assignments over data variables, and with participants binders. The latter allow us to model scenarios with an unbounded number of participants which can vary at run-time. We introduce a notion of well-formedness to rule out meaningless or problematic specifications. This notion is verified with TRAC and demonstrated on several case studies borrowed from the smart contracts domain. Then, we evaluate the performance of TRAC using a set of randomised examples, studying the correlations between the features supported and the time taken to decide well-formedness.
title TRAC: a tool for data-aware coordination (with an application to smart contracts)
topic Logic in Computer Science
url https://arxiv.org/abs/2404.19523