Publikation:

An Automata-theoretic Basis for Specification and Type Checking of Multiparty Protocols

Vorschaubild

Dateien

Stutz_2-x3puvmdi1d3u9.pdf
Stutz_2-x3puvmdi1d3u9.pdfGröße: 669.79 KBDownloads: 23

Datum

2025

Autor:innen

Stutz, Felix

Herausgeber:innen

Kontakt

ISSN der Zeitschrift

Electronic ISSN

ISBN

Bibliografische Daten

Verlag

Schriftenreihe

Auflagebezeichnung

URI (zitierfähiger Link)
http://nbn-resolving.de/urn:nbn:de:bsz:352-2-x3puvmdi1d3u9
DOI (zitierfähiger Link)
https://doi.org/10.1007/978-3-031-91121-7_13
ArXiv-ID
http://arxiv.org/abs/2501.16977

Internationale Patentnummer

Link zur Lizenz

CC BY 4.0

Angaben zur Forschungsförderung

European Union (EU): 101003349

Projekt

Open Access-Veröffentlichung
Open Access Bookpart

Sammlungen

Informatik und Informationswissenschaft: Publikationen
Core Facility der Universität Konstanz

Gesperrt bis

Titel in einer weiteren Sprache

Publikationstyp
Beitrag zu einem Konferenzband
Publikationsstatus
Published

Erschienen in

VAFEIADIS, Viktor, Hrsg.. Programming Languages and Systems : 34th European Symposium on Programming, ESOP 2025, Held as Part of the International Joint Conferences on Theory and Practice of Software, ETAPS 2025, Proceedings, Part II. Cham: Springer, 2025, S. 314-346. Lecture Notes in Computer Science. 15695. ISBN 978-3-031-91120-0. Verfügbar unter: doi: 10.1007/978-3-031-91121-7_13

Zusammenfassung

We propose the Automata-based Multiparty Protocols framework (AMP) for top-down protocol development. The framework features a new very general formalism for global protocol specifications called Protocol State Machines (PSMs), Communicating State Machines (CSMs) as specifications for local participants, and a type system to check a -calculus with session interleaving and delegation against the CSM specification. Moreover, we define a large class of PSMs, called “tame”, for which we provide a sound and complete PSPACE projection operation that computes a CSM describing the same protocol as a given PSM if one exists. We propose these components as a backwards-compatible new backend for frameworks in the style of Multiparty Session Types. In comparison to the latter, AMP offers a considerable improvement in expressivity, decoupling of the various components (e.g. projection and typing), and robustness (thanks to the complete projection).

Zusammenfassung in einer weiteren Sprache

Fachgebiet (DDC)
004 Informatik

Schlagwörter

Konferenz

ESOP 2025 : 34th European Symposium on Programming, 3. Mai 2025 - 8. Mai 2025, Hamilton, ON, Canada
Rezension
undefined / . - undefined, undefined

Forschungsvorhaben

Organisationseinheiten

Zeitschriftenheft

Zugehörige Datensätze in KOPS

Zitieren

ISO 690STUTZ, Felix, Emanuele D'OSUALDO, 2025. An Automata-theoretic Basis for Specification and Type Checking of Multiparty Protocols. ESOP 2025 : 34th European Symposium on Programming. Hamilton, ON, Canada, 3. Mai 2025 - 8. Mai 2025. In: VAFEIADIS, Viktor, Hrsg.. Programming Languages and Systems : 34th European Symposium on Programming, ESOP 2025, Held as Part of the International Joint Conferences on Theory and Practice of Software, ETAPS 2025, Proceedings, Part II. Cham: Springer, 2025, S. 314-346. Lecture Notes in Computer Science. 15695. ISBN 978-3-031-91120-0. Verfügbar unter: doi: 10.1007/978-3-031-91121-7_13
BibTex
@inproceedings{Stutz2025Autom-74627,
  title={An Automata-theoretic Basis for Specification and Type Checking of Multiparty Protocols},
  year={2025},
  doi={10.1007/978-3-031-91121-7_13},
  number={15695},
  isbn={978-3-031-91120-0},
  address={Cham},
  publisher={Springer},
  series={Lecture Notes in Computer Science},
  booktitle={Programming Languages and Systems : 34th European Symposium on Programming, ESOP 2025, Held as Part of the International Joint Conferences on Theory and Practice of Software, ETAPS 2025, Proceedings, Part II},
  pages={314--346},
  editor={Vafeiadis, Viktor},
  author={Stutz, Felix and D'Osualdo, Emanuele}
}
RDF
<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/74627">
    <dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/74627/1/Stutz_2-x3puvmdi1d3u9.pdf"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Stutz, Felix</dc:contributor>
    <dcterms:rights rdf:resource="http://creativecommons.org/licenses/by/4.0/"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2025-09-30T10:27:54Z</dcterms:available>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:title>An Automata-theoretic Basis for Specification and Type Checking of Multiparty Protocols</dcterms:title>
    <dc:contributor>D'Osualdo, Emanuele</dc:contributor>
    <dc:creator>Stutz, Felix</dc:creator>
    <dc:creator>D'Osualdo, Emanuele</dc:creator>
    <dcterms:issued>2025</dcterms:issued>
    <dc:rights>Attribution 4.0 International</dc:rights>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2025-09-30T10:27:54Z</dc:date>
    <dc:language>eng</dc:language>
    <dcterms:abstract>We propose the Automata-based Multiparty Protocols framework (AMP) for top-down protocol development. The framework features a new very general formalism for global protocol specifications called Protocol State Machines (PSMs), Communicating State Machines (CSMs) as specifications for local participants, and a type system to check a -calculus with session interleaving and delegation against the CSM specification. Moreover, we define a large class of PSMs, called “tame”, for which we provide a sound and complete PSPACE projection operation that computes a CSM describing the same protocol as a given PSM if one exists. We propose these components as a backwards-compatible new backend for frameworks in the style of Multiparty Session Types. In comparison to the latter, AMP offers a considerable improvement in expressivity, decoupling of the various components (e.g. projection and typing), and robustness (thanks to the complete projection).</dcterms:abstract>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/74627"/>
    <dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/74627/1/Stutz_2-x3puvmdi1d3u9.pdf"/>
  </rdf:Description>
</rdf:RDF>

Interner Vermerk

xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter

Kontakt
URL der Originalveröffentl.

Prüfdatum der URL

Prüfungsdatum der Dissertation

Finanzierungsart

Kommentar zur Publikation

Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja
Begutachtet
Diese Publikation teilen