Using Symbolic Execution to Transform Turbo Abstract State Machines into Basic Abstract State Machines

Giuseppe Del Castillo
Digital Printed Abstract View Cite
Type
Case Study
Publication
10th International Conference on Rigorous State Based Methods (ABZ'24)

Abstract

This paper introduces a transformation method that uses symbolic execution to eliminate sequential composition ((\texttt {seq})) rules from turbo ASM rules by translating them into equivalent rules without seq. Under some circumstances (\texttt {iterate}) rules can also be eliminated. The material presented here is work in progress. A prototype implementation of the transformation is publicly available.

Document

If you cannot see the document below, the PDF document is most likely not freely accessible. In this case, please try to access the document via this link.

Reference

% BibTex
@inproceedings{Castillo24,
  author       = {Giuseppe Del Castillo},
  editor       = {Silvia Bonfanti and
                  Angelo Gargantini and
                  Michael Leuschel and
                  Elvinia Riccobene and
                  Patrizia Scandurra},
  title        = {Using Symbolic Execution to Transform Turbo Abstract State Machines
                  into Basic Abstract State Machines},
  booktitle    = {Rigorous State-Based Methods - 10th International Conference, {ABZ}
                  2024, Bergamo, Italy, June 25-28, 2024, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {14759},
  pages        = {215--222},
  publisher    = {Springer},
  year         = {2024},
  url          = {https://doi.org/10.1007/978-3-031-63790-2\_15},
  doi          = {10.1007/978-3-031-63790-2\_15},
  timestamp    = {Thu, 04 Jul 2024 22:05:23 +0200},
  biburl       = {https://dblp.org/rec/conf/zum/Castillo24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
ABZ'24

Related