Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH scholarly article en Bauer, Jörg; Wilhelm, Reinhard License
when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-7271
URL:

;

Analysis of Dynamic Communicating Systems by Hierarchical Abstraction

pdf-format:


Abstract

We propose a new abstraction technique for verifying topology properties
of dynamic communicating systems (DCS), a special class of infinite-state
systems. DCS are characterized by unbounded creation and destruction of
objects along with an evolving communication connectivity or topology.
We employ a lightweight graph transformation system to specify DCS.
Hierarchical Abstraction (HA) computes a bounded over-approximation of
all topologies that can occur in a DCS directly
from its transformation rules. HA works in two steps.
First, for each connected component, called cluster, of a topology,
objects sharing a common property are summarized to one abstract object.
Then isomorphic abstract connected components are summarized to
one abstract component, called abstract cluster.
This yields a conservative approximation of all graphs that may occur
during any DCS run.
The technique is implemented.

BibTeX - Entry

@InProceedings{bauer_et_al:DagSemProc.06081.3,
  author =	{Bauer, J\"{o}rg and Wilhelm, Reinhard},
  title =	{{Analysis of Dynamic Communicating Systems by Hierarchical Abstraction}},
  booktitle =	{Software Verification: Infinite-State Model Checking and Static Program Analysis},
  pages =	{1--25},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{6081},
  editor =	{Parosh Aziz Abdulla and Ahmed Bouajjani and Markus M\"{u}ller-Olm},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2006/727},
  URN =		{urn:nbn:de:0030-drops-7271},
  doi =		{10.4230/DagSemProc.06081.3},
  annote =	{Keywords: Graph transformation, Abstract Interpretation, Shape Analysis}
}

Keywords: Graph transformation, Abstract Interpretation, Shape Analysis
Seminar: 06081 - Software Verification: Infinite-State Model Checking and Static Program Analysis
Issue date: 2006
Date of publication: 09.11.2006


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI