VERIFICATION OF AUTOMATA-BASED PROGRAMS WITH SPIN VERIFIER

A. A. Shalyto, M. Lukin


Read the full article  ';

Abstract

A way to use SPIN verifier for the verification of automata-based programs is proposed. When using this verifier model is described with  Promela language and requirements are specified with  LTL language. A method of automated automata-based program to  Promela model transformation is proposed. For LTL-formulas 

transformation a special program was developed. Usage of this methods is illustrated on the example of cashmachine model verification.

Keywords: program verification, model checking, automata-based programming, SPIN verifier

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License
Copyright 2001-2024 ©
Scientific and Technical Journal
of Information Technologies, Mechanics and Optics.
All rights reserved.

Яндекс.Метрика