# Exploiting over- and under-approximations for infinite-state counterpart models

Lluch-Lafuente, Alberto and Gadducci, Fabio and Vandin, Andrea Exploiting over- and under-approximations for infinite-state counterpart models. In: Graph Transformations. Lecture Notes in Computer Science (7562). Springer, pp. 51-65. ISBN 978-3-642-33654-6 (2012)

 Preview
PDF - Draft Version

## Abstract

Software systems with dynamic topology are often infini-testate. Paradigmatic examples are those modeled as graph transformation systems (GTSs) with rewrite rules that allow an unbounded creation of items. For such systems, verification can become intractable, thus calling for the development of approximation techniques that may ease the verification at the cost of losing in preciseness and completeness. Both over- and under-approximations have been considered in the literature, respectively offering more and less behaviors than the original system. At the same time, properties of the system may be either preserved or reflected by a given approximation. In this paper we propose a general notion of approximation that captures some of the existing approaches for GTSs. Formulae are specified by a generic quantified modal logic, one that also generalizes many specification logics adopted in the literature for GTSs. We also propose a type system to denote part of the formulae as either reflected or preserved, together with a technique that exploits under- and over-approximations to reason about typed as well as untyped formulae

Item Type: Book Section 10.1007/978-3-642-33654-6_4 6th International Conference, ICGT 2012, Bremen, Germany, September 24-29, 2012. Proceedings ASCENS graph transition systems, approximated verification, abstraction,graph logics. Q Science > QA Mathematics > QA75 Electronic computers. Computer science Computer Science and Applications Users 30 not found. 29 Jun 2012 11:10 13 Jul 2016 09:49 http://eprints.imtlucca.it/id/eprint/1292