SMT for state-based formal methods: the ASM case study

18 pages•Published: April 16, 2018

Paolo Arcaini, Angelo Gargantini and Elvinia Riccobene

Abstract

State-based transition systems can take advantage of a symbolic representation of the concepts of state and transition in order to automatically solve verification questions that could not be otherwise tackled in terms of explicit representation of the transition system. We report here our experience in developing solutions, approaches and supporting tools of verification problems regarding the Abstract State Machines (ASMs), a transition system which can be considered as an extension of Finite State Machines. We present the symbolic representation of an ASM and of its computational model in terms of the Yices SMT solver. We also discuss two scenarios of verification questions regarding the ASMs for which the symbolic representation helped us to formalize and solve the problem by satisfiability checking, namely automatic proof of correct ASM refinement and runtime verification.

Keyphrases: abstract state machines, refinement proof, runtime verification, smt solver, yices

In: Natarajan Shankar and Bruno Dutertre (editors). Automated Formal Methods, vol 5, pages 1-18.

Links:	https://easychair.org/publications/paper/b6HD
	https://doi.org/10.29007/djdz

BibTeX entry

@inproceedings{AFM17:SMT_state_based_formal,
  author    = {Paolo Arcaini and Angelo Gargantini and Elvinia Riccobene},
  title     = {SMT for state-based formal methods: the ASM case study},
  booktitle = {Automated Formal Methods},
  editor    = {Natarajan Shankar and Bruno Dutertre},
  series    = {Kalpa Publications in Computing},
  volume    = {5},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2515-1762},
  url       = {/publications/paper/b6HD},
  doi       = {10.29007/djdz},
  pages     = {1-18},
  year      = {2018}}

Download PDF Open PDF in browser