eprintid: 1292
rev_number: 16
eprint_status: archive
userid: 30
dir: disk0/00/00/12/92
datestamp: 2012-06-29 11:10:58
lastmod: 2016-07-13 09:49:16
status_changed: 2012-06-29 11:13:30
type: book_section
metadata_visibility: show
creators_name: Lluch-Lafuente, Alberto
creators_name: Gadducci, Fabio
creators_name: Vandin, Andrea
creators_id: alberto.lluch@imtlucca.it
creators_id: 
creators_id: andrea.vandin@imtlucca.it
title: Exploiting over- and under-approximations for infinite-state counterpart models
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: public
keywords: graph transition systems, approximated verification, abstraction,graph logics.
note: 6th International Conference, ICGT 2012, Bremen, Germany, September 24-29, 2012. Proceedings
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
date: 2012
date_type: published
series: Lecture Notes in Computer Science
number: 7562
publisher: Springer
pagerange: 51-65
id_number: 10.1007/978-3-642-33654-6_4
refereed: TRUE
isbn: 978-3-642-33654-6
book_title: Graph Transformations
official_url: http://dx.doi.org/10.1007/978-3-642-33654-6_4
projects: ASCENS
citation:   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)  
document_url: http://eprints.imtlucca.it/1292/1/icgt2012.pdf