About: A Sound Algorithm for Asynchronous Session Subtyping

Not logged in : Login

(Sponging disallowed)

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: A Sound Algorithm for Asynchronous Session Subtyping Goto Sponge NotDistinct Permalink

An Entity of Type : bibo:AcademicArticle, within Data Space : linkeddata.uriburner.com:28898 associated with source document(s)

Attributes	Values
type	http://eprints.org/ontology/ConferenceItemEPrint http://eprints.org/ontology/EPrint Article Academic Article
seeAlso	HTML Summary of #75503 A Sound Algorithm for Asynchronous Session Subtyping
sameAs	A Sound Algorithm for Asynchronous Session Subtyping
http://www.loc.gov...erms/relators/EDT	Wan Fokkink Rob van Glabbeek
http://eprints.org/ontology/hasAccepted	A Sound Algorithm for Asynchronous Session Subtyping (PDF)
http://eprints.org/ontology/hasDocument	A Sound Algorithm for Asynchronous Session Subtyping (PDF) A Sound Algorithm for Asynchronous Session Subtyping (Other) A Sound Algorithm for Asynchronous Session Subtyping (Other) A Sound Algorithm for Asynchronous Session Subtyping (Other) A Sound Algorithm for Asynchronous Session Subtyping (Other) A Sound Algorithm for Asynchronous Session Subtyping (Other)
dc:hasVersion	A Sound Algorithm for Asynchronous Session Subtyping (PDF)
Title	A Sound Algorithm for Asynchronous Session Subtyping
described by	https://demo.openlinksw.com/about/id/entity/https/www.cs.kent.ac.uk/people/staff/akj22/materials/CO644/export_kar_RDFN3.n3
Date	2019-09-01
Creator	Marco Carbone Gianluigi Zavattaro Mario Bravetti Julien Lange Nobuko Yoshida
status	peer reviewed published
Publisher	LIPICS
abstract	Session types, types for structuring communication between endpoints in distributed systems, are recently being integrated into mainstream programming languages. In practice, a very important notion for dealing with such types is that of subtyping, since it allows for typing larger classes of system, where a program has not precisely the expected behavior but a similar one. Unfortunately, recent work has shown that subtyping for session types in an asynchronous setting is undecidable. To cope with this negative result, the only approaches we are aware of either restrict the syntax of session types or limit communication (by considering forms of bounded asynchrony). Both approaches are too restrictive in practice, hence we proceed differently by presenting an algorithm for checking subtyping which is sound, but not complete (in some cases it terminates without returning a decisive verdict). The algorithm is based on a tree representation of the coinductive definition of asynchronous subtyping; this tree could be infinite, and the algorithm checks for the presence of finite witnesses of infinite successful subtrees. Furthermore, we provide a tool that implements our algorithm and we apply it to many examples that cannot be managed with the previous approaches.
Is Part Of	Leibniz International Proceedings in Informatics https://kar.kent.ac.uk/id/repository
list of authors	https://kar.kent.ac.uk/id/eprint/75503#authors
list of editors	https://kar.kent.ac.uk/id/eprint/75503#editors
presented at	30th International Conference on Concurrency Theory (CONCUR 2019)
volume	140
is topic of	https://www.cs.kent.ac.uk/people/staff/akj22/materials/CO644/export_kar_RDFN3.n3
is primary topic of	HTML Summary of #75503 A Sound Algorithm for Asynchronous Session Subtyping

Faceted Search & Find service v1.17_git149 as of Dec 03 2024

Alternative Linked Data Documents: iSPARQL | ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3331 as of Aug 25 2024, on Linux (x86_64-ubuntu_noble-linux-glibc2.38-64), Single-Server Edition (378 GB total memory, 13 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software