Neykova, Rumyana, Bocchi, Laura, Yoshida, Nobuko (2014) Timed Runtime Monitoring for Multiparty Conversations. In: Proceedings Third Workshop on Behavioural Types. Electronic Proceedings in Theoretical Computer Science . pp. 19-26. (doi:10.4204/EPTCS.162.3) (KAR id:43736)
PDF
Language: English |
|
Download this file (PDF/643kB) |
Preview |
Request a format suitable for use with assistive technology e.g. a screenreader | |
Official URL: http://dx.doi.org/10.4204/EPTCS.162.3 |
Abstract
We propose a dynamic verification framework for protocols in real-time distributed systems. The framework is based on Scribble, a tool-chain for design and verification of choreographies based on multiparty session types, developed with our industrial partners. Drawing from recent work on multiparty session types for real-time interactions, we extend Scribble with clocks, resets, and clock predicates constraining the times in which interactions should occur. We present a timed API for Python to program distributed implementations of Scribble specifications. A dynamic verification framework ensures the safe execution of applications written with our timed API: we have implemented dedicated runtime monitors that check that each interaction occurs at a correct timing with respect to the corresponding Scribble specification. The performance of our implementation and its practicability are analysed via benchmarking.
Item Type: | Conference or workshop item (Paper) |
---|---|
DOI/Identification number: | 10.4204/EPTCS.162.3 |
Subjects: | Q Science > QA Mathematics (inc Computing science) > QA299 Analysis, Calculus |
Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Depositing User: | Laura Bocchi |
Date Deposited: | 05 Nov 2014 10:23 UTC |
Last Modified: | 11 Dec 2022 02:26 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/43736 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):