Skip to main content

Verifying Asynchronous Interactions via Communicating Session Automata

Lange, Julien and Yoshida, Nobuko (2019) Verifying Asynchronous Interactions via Communicating Session Automata. In: Computer Aided Verification. CAV 2019. Lecture Notes in Computer Science (11561). Springer, pp. 97-117. ISBN 978-3-030-25539-8. E-ISBN 978-3-030-25540-4. (doi:10.1007/978-3-030-25540-4_6) (KAR id:74012)

PDF Supplemental Material
Language: English

Restricted to Repository staff only
Contact us about this Publication
[img]
PDF Author's Accepted Manuscript
Language: English


Creative Commons Licence
This work is licensed under a Creative Commons Attribution 4.0 International License.
Download (797kB) Preview
[img]
Preview
Official URL
https://link.springer.com/chapter/10.1007/978-3-03...

Abstract

This paper proposes a sound procedure to verify properties of communicating session automata (CSA), i.e., communicating automata that include multiparty session types. We introduce a new asynchronous compatibility property for CSA, called k-multiparty compatibility (k-MC), which is a strict superset of the synchronous multiparty compatibility used in theories and tools based on session types. It is decomposed into two bounded properties: (i) a condition called k-safety which guarantees that, within the bound, all sent messages can be received and each automaton can make a move; and (ii) a condition called k-exhaustivity which guarantees that all k-reachable send actions can be fired within the bound. We show that k-exhaustivity implies existential boundedness, and soundly and completely characterises systems where each automaton behaves equivalently under bounds greater than or equal to k. We show that checking k-MC is PSPACE-complete, and demonstrate its performance empirically over large systems using partial order reduction.

Item Type: Book section
DOI/Identification number: 10.1007/978-3-030-25540-4_6
Uncontrolled keywords: verification, message passing concurrency, asynchrony, communicating automata, session types
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing
Depositing User: Julien Lange
Date Deposited: 21 May 2019 11:01 UTC
Last Modified: 24 Jan 2020 11:42 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/74012 (The current URI for this page, for reference purposes)
Lange, Julien: https://orcid.org/0000-0001-9697-1378
  • Depositors only (login required):

Downloads

Downloads per month over past year