Usage of Invariants for Symbolic Verification of Requirements

1 pages•Published: June 19, 2013

Alexander Letichevsky, Alexander Godlevsky, Anton Guba, Alexander Kolchin, Oleksandr Letychevskyi and Vladimir Peschanenko

Abstract

The paper presents the usage of invariants for symbolic verification of requirements for reactive systems. It includes checking of safety, incompleteness, liveness, consistency properties, and livelock detection. The paper describes the iterative method of double approximation and the method of undetermined coefficients for invariants generation. Benefits, disadvantages, and comparison of this technique with existing methods are considered. The paper is illustrated by examples of invariants technique usage for symbolic verification.

Keyphrases: invariants, requirements specification, symbolic verification

In: Laura Kovacs and Temur Kutsia (editors). SCSS 2013. 5th International Symposium on Symbolic Computation in Software Science, vol 15, pages 124.

Links:	https://easychair.org/publications/paper/rS
	https://doi.org/10.29007/2nr2

BibTeX entry

@inproceedings{SCSS2013:Usage_Invariants_Symbolic_Verification,
  author    = {Alexander Letichevsky and Alexander Godlevsky and Anton Guba and Alexander Kolchin and Oleksandr Letychevskyi and Vladimir Peschanenko},
  title     = {Usage of Invariants for Symbolic Verification of Requirements},
  booktitle = {SCSS 2013. 5th International Symposium on Symbolic Computation in Software Science},
  editor    = {Laura Kovacs and Temur Kutsia},
  series    = {EPiC Series in Computing},
  volume    = {15},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/rS},
  doi       = {10.29007/2nr2},
  pages     = {124},
  year      = {2013}}

Download PDF Open PDF in browser