Finite countermodels as invariants. A case study in verification of parameterized mutual exclusion protocol

2 pages•Published: June 22, 2012

Abstract

We present a case study of the verification of parameterized mutual exclusion protocol using finite model finder Mace4. Thhe verification follows an approach based on modeling of reachability between states of the protocol as deducibility between appropriate encodings of states by first-order predicate logic formulae. The result of successful verification is a finite countermodel, a witness of non-deducibility, which represents a system invariant.

Keyphrases: finite model finders, first order predicate logic, infinite state systems, parameterized systems

In: Andrei Voronkov, Laura Kovacs and Nikolaj Bjorner (editors). WING 2010. Workshop on Invariant Generation 2010, vol 1, pages 150-151.

Links:	https://easychair.org/publications/paper/5dM
	https://doi.org/10.29007/gt85

BibTeX entry

@inproceedings{WING2010:Finite_countermodels_as_invariants.,
  author    = {Alexei Lisitsa},
  title     = {Finite countermodels as invariants. A case study in verification of parameterized mutual exclusion protocol},
  booktitle = {WING 2010. Workshop on Invariant Generation 2010},
  editor    = {Andrei Voronkov and Laura Kovacs and Nikolaj Bjorner},
  series    = {EPiC Series in Computing},
  volume    = {1},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/5dM},
  doi       = {10.29007/gt85},
  pages     = {150-151},
  year      = {2012}}

Download PDF Open PDF in browser