This HTML5 document contains 35 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n2https://kar.kent.ac.uk/id/eprint/
wdrshttp://www.w3.org/2007/05/powder-s#
dchttp://purl.org/dc/elements/1.1/
n13http://purl.org/ontology/bibo/status/
rdfshttp://www.w3.org/2000/01/rdf-schema#
n11https://demo.openlinksw.com/about/id/entity/https/raw.githubusercontent.com/annajordanous/CO644Files/main/
n3http://eprints.org/ontology/
n17doi:10.4230/
n19https://kar.kent.ac.uk/id/event/
n10http://www.loc.gov/loc.terms/relators/
bibohttp://purl.org/ontology/bibo/
n12https://kar.kent.ac.uk/id/publication/
n18https://kar.kent.ac.uk/id/org/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n20https://kar.kent.ac.uk/id/eprint/75503#
n15https://kar.kent.ac.uk/75503/
n4https://kar.kent.ac.uk/id/document/
n21https://kar.kent.ac.uk/id/
xsdhhttp://www.w3.org/2001/XMLSchema#
n8https://demo.openlinksw.com/about/id/entity/https/www.cs.kent.ac.uk/people/staff/akj22/materials/CO644/
n6https://kar.kent.ac.uk/id/person/

Statements

Subject Item
n2:75503
rdf:type
bibo:Article n3:EPrint n3:ConferenceItemEPrint bibo:AcademicArticle
rdfs:seeAlso
n15:
owl:sameAs
n17:LIPIcs.CONCUR.2019.34
n10:EDT
n6:ext-6b30d6b281eb353515f4824b6c9c91ce n6:ext-26b6c6ad367e70d853589e4d734376d5
n3:hasAccepted
n4:3183713
n3:hasDocument
n4:3183718 n4:3183714 n4:3183715 n4:3183716 n4:3183717 n4:3183713
dc:hasVersion
n4:3183713
dcterms:title
A Sound Algorithm for Asynchronous Session Subtyping
wdrs:describedby
n8:export_kar_RDFN3.n3 n11:export_kar_RDFN3.n3
dcterms:date
2019-09-01
dcterms:creator
n6:ext-j.s.lange@kent.ac.uk n6:ext-a6df465f1de880cf512172108895289b n6:ext-n.yoshida@imperial.ac.uk n6:ext-aaa3105adc2b0828a8381a456a87b203 n6:ext-757d55a32bb44ae84ad759d05130bbe1
bibo:status
n13:peerReviewed n13:published
dcterms:publisher
n18:ext-c24cf14e0730bd3ce4837d0b8bf25b31
bibo: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.
dcterms:isPartOf
n12:ext-18688969 n21:repository
bibo:authorList
n20:authors
bibo:editorList
n20:editors
bibo:presentedAt
n19:ext-9f836065fa4c01efc8d0b81b209bf44d
bibo:volume
140