Sammartino, M;
Silva, A;
Ferreira, T;
D'Antoni, L;
(2019)
Symbolic Register Automata.
In: Dillig, I and Tasiran, S, (eds.)
International Conference on Computer Aided Verification, CAV 2019. Lecture Notes in Computer Science, vol 11561.
Springer: Cham.
Preview |
Text
Sammartino_2019_Book_ComputerAidedVerification(Edited).pdf - Published Version Download (584kB) | Preview |
Abstract
Symbolic Finite Automata and Register Automata are two orthogonal extensions of finite automata motivated by real-world problems where data may have unbounded domains. These automata address a demand for a model over large or infinite alphabets, respectively. Both automata models have interesting applications and have been successful in their own right. In this paper, we introduce Symbolic Register Automata, a new model that combines features from both symbolic and register automata, with a view on applications that were previously out of reach. We study their properties and provide algorithms for emptiness, inclusion and equivalence checking, together with experimental results.
| Type: | Proceedings paper |
|---|---|
| Title: | Symbolic Register Automata |
| Event: | 31st International Conference on Computer-Aided Verification |
| ISBN-13: | 978-3-030-25539-8 |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1007/978-3-030-25540-4_1 |
| Publisher version: | https://doi.org/10.1007/978-3-030-25540-4_1 |
| Language: | English |
| Additional information: | Copyright information © The Author(s) 2019 Open Access This chapter is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made. The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
| URI: | https://discovery.ucl.ac.uk/id/eprint/10074295 |
Archive Staff Only
 |
View Item |
