Publication detail

Parameterized verification through view abstraction

HOLÍK, L. ABDULLA, P. HAZIZA, F.

Original Title

Parameterized verification through view abstraction

Type

journal article in Web of Science

Language

English

Original Abstract

We present a simple and efficient framework for automatic verification of systems with a parametric number of communicating processes. The processes may be organized in various topologies such as words, multisets, rings, or trees. Our method needs to inspect only a small number of processes in order to show correctness of the whole system. It relies on an abstraction function that views the system from the perspective of a fixed number of processes. The abstraction is used during the verification procedure in order to dynamically detect cut-off points beyond which the search of the state space need not continue. We show that the method is complete for a large class of well quasi-ordered systems including Petri nets. Our experimentation on a variety of benchmarks demonstrate that the method is highly efficient and that it works well even for classes of systems with undecidable verification problems. In particular, the method handles the fine-grained and full version of Szymanski's mutual exclusion protocol, whose correctness, to the best of our knowledge, has not been proven automatically by any other existing methods.

Keywords

Parameterized systems Safety Small model properties View abstraction

Authors

HOLÍK, L.; ABDULLA, P.; HAZIZA, F.

RIV year

2015

Released

23. 11. 2015

ISBN

1433-2779

Periodical

International Journal on Software Tools for Technology Transfer

Year of study

2016

Number

5

State

Federal Republic of Germany

Pages from

495

Pages to

516

Pages count

22

URL

BibTex

@article{BUT133508,
  author="Lukáš {Holík} and Parosh {Abdulla} and Frédéric {Haziza}",
  title="Parameterized verification through view abstraction",
  journal="International Journal on Software Tools for Technology Transfer",
  year="2015",
  volume="2016",
  number="5",
  pages="495--516",
  doi="10.1007/s10009-015-0406-x",
  issn="1433-2779",
  url="http://link.springer.com/article/10.1007%2Fs10009-015-0406-x"
}