Characteristic Formulae for Session Types

File Description SizeFormat 
paper.pdfAccepted version599.83 kBAdobe PDFView/Open
Title: Characteristic Formulae for Session Types
Authors: Lange, J
Yoshida, N
Item Type: Conference Paper
Abstract: © Springer-Verlag Berlin Heidelberg 2016.Subtyping is a crucial ingredient of session type theory and its applications, notably to programming language implementations. In this paper, we study effective ways to check whether a session type is a subtype of another by applying a characteristic formulae approach to the problem. Our core contribution is an algorithm to generate a modal μ-calculus formula that characterises all the supertypes (or subtypes) of a given type. Subtyping checks can then be off-loaded to model checkers, thus incidentally yielding an efficient algorithm to check safety of session types, soundly and completely. We have implemented our theory and compared its cost with other classical subtyping algorithms.
Issue Date: 1-Apr-2016
Date of Acceptance: 18-Dec-2015
ISBN: 978-3-662-49673-2
ISSN: 0302-9743
Publisher: Springer
Start Page: 833
End Page: 850
Journal / Book Title: Lecture Notes in Computer Science
Volume: 9636
Copyright Statement: The final publication is available at Springer via
Sponsor/Funder: Engineering & Physical Science Research Council (E
Engineering & Physical Science Research Council (E
Engineering & Physical Science Research Council (EPSRC)
Commission of the European Communities
Funder's Grant Number: ERI 025567 (EP/K034413/1)
PO 1553380
Conference Name: TACAS 2016
Keywords: Artificial Intelligence & Image Processing
08 Information And Computing Sciences
Publication Status: Published
Start Date: 2016-04-02
Finish Date: 2016-04-08
Conference Place: Eindhoven, The Netherlands
Appears in Collections:Faculty of Engineering

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Creative Commonsx