Encoding Abstract State Machines in PVS

  • Authors:
  • Angelo Gargantini;Elvinia Riccobene

  • Affiliations:
  • -;-

  • Venue:
  • ASM '00 Proceedings of the International Workshop on Abstract State Machines, Theory and Applications
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we show how the specification and verification system PVS (Prototype Verification System) can provide tool support for Abstract State Machines (ASMs), especially oriented towards automatic proof checking and mechanized proving of properties. Useful templates are presented which allow encoding of ASM models into PVS without any extra user's skill. We prove the transformation preserves the ASM semantics and provide a framework for an automatic tool, prototypically implemented, which translates ASM specifications in PVS. The ASM specification of the Production Cell given in [4] is taken as case study to show how to formalize multi-agent ASMs in PVS and prove properties.