Verifying Asynchronous Interactions via Communicating Session Automata
- Submitting institution
-
The University of Kent
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 16122
- Type
- E - Conference contribution
- DOI
-
10.1007/978-3-030-25540-4_6
- Title of conference / published proceedings
- Proceedings of the 31st International Conference on Computer-Aided Verification - CAV 2019
- First page
- 97
- Volume
- 11561
- Issue
- -
- ISSN
- 0302-9743
- Open access status
- Compliant
- Month of publication
- July
- Year of publication
- 2019
- URL
-
https://kar.kent.ac.uk/74012/
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
-
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This paper is significant because it defines a general verification procedure that completely subsumes all previous approaches based on session types and communicating finite-state machines (CFSMs). Our procedure enables the static verification of concurrent programs that communicate over (un)bounded channels, even when the bounds are not statically known. This work establishes a practical solution to the membership problem for the class of existential bounded CFSMs. We demonstrate the scalability and the applicability of the approach with a thorough empirical evaluation (which was validated by the artifact evaluation committee of CAV’19).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
