Unified Syntax for Abstract State Machines

Abstract

The paper presents our efforts in defining UASM, a unified syntax for Abstract State Machines (ASMs), based on the syntaxes of two of the main ASM frameworks, CoreASM and ASMETA, which have been adapted to accept UASM as input syntax of all their validation and verification tools.

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{ArcainiBDGMRRSS16,
  author       = {Paolo Arcaini and
                  Silvia Bonfanti and
                  Marcel Dausend and
                  Angelo Gargantini and
                  Atif Mashkoor and
                  Alexander Raschke and
                  Elvinia Riccobene and
                  Patrizia Scandurra and
                  Michael Stegmaier},
  editor       = {Michael J. Butler and
                  Klaus{-}Dieter Schewe and
                  Atif Mashkoor and
                  Mikl{\'{o}}s Bir{\'{o}}},
  title        = {Unified Syntax for Abstract State Machines},
  booktitle    = {Abstract State Machines, Alloy, B, TLA, VDM, and {Z} - 5th International
                  Conference, {ABZ} 2016, Linz, Austria, May 23-27, 2016, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {9675},
  pages        = {231--236},
  publisher    = {Springer},
  year         = {2016},
  url          = {https://doi.org/10.1007/978-3-319-33600-8\_14},
  doi          = {10.1007/978-3-319-33600-8\_14},
  timestamp    = {Thu, 14 Oct 2021 10:31:49 +0200},
  biburl       = {https://dblp.org/rec/conf/asm/ArcainiBDGMRRSS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}