Partial Typing for Asynchronous Multiparty Sessions

Formal verification methods for concurrent systems cannot always be scaled-down or tailored in order to be applied on specific subsystems. We address such an issue in a MultiParty Session Types setting by devising a partial type assignment system for multiparty sessions (i.e. sets of concurrent participants) with asynchronous communications. Sessions are possibly typed by "asynchronous global types" describing the overall behaviour of specific subsets of participants only (from which the word "partial"). Typability is proven to ensure that sessions enjoy the partial versions of the well-known properties of lock- and orphan-message-freedom.

Authors

Institutions

Publication Details

Journal
Electronic Proceedings in Theoretical Computer Science
Published
2024-09-28
DOI
https://doi.org/10.4204/eptcs.408.1
Citations
3
Primary Topic
Formal Methods in Verification
Type
article
Field-Weighted Citation Impact
1.08

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Partial Typing for Asynchronous Multiparty Sessions

Ugo de’Liguoro, Franco Barbanera, Mariangiola Dezani-Ciancaglini
3 citations
Electronic Proceedings in Theoretical Computer Science
Formal Methods in Verification
1.08
article

Partial Typing for Asynchronous Multiparty Sessions

Ugo de’Liguoro, Franco Barbanera, Mariangiola Dezani-Ciancaglini
article en
3 citations

Abstract

Formal verification methods for concurrent systems cannot always be scaled-down or tailored in order to be applied on specific subsystems. We address such an issue in a MultiParty Session Types setting by devising a partial type assignment system for multiparty sessions (i.e. sets of concurrent participants) with asynchronous communications. Sessions are possibly typed by "asynchronous global types" describing the overall behaviour of specific subsets of participants only (from which the word "partial"). Typability is proven to ensure that sessions enjoy the partial versions of the well-known properties of lock- and orphan-message-freedom.

Electronic Proceedings in Theoretical Computer ScienceVol. 408
University of Catania (IT), University of Turin (IT)
Istituto Nazionale di Alta Matematica "Francesco Severi", Gruppo Nazionale per il Calcolo Scientifico
Openalex Percentile: Top 20%
Formal Methods in Verification
1.08
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Partial Typing for Asynchronous Multiparty Sessions — Ugo de’Liguoro, Franco Barbanera, et al. · Electronic Proceedings in Theoretical Computer Science (2024) | TGRS Research Map | TGRS