ASTRA: A Tool for Abstract Interpretation of Graph Transformation Systems

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9232)


We describe ASTRA (see, a tool for the static analysis of infinite-state graph transformation systems. It is based on abstract interpretation and implements cluster abstraction, i.e., it computes a finite overapproximation of the set of reachable graphs by decomposing them into small, overlapping clusters of nodes. While related tools lack support for negative application conditions, accept only a limited class of graph transformation systems, or suffer from state-space explosion on models with (even moderate) concurrency, ASTRA can cope with scenarios that combine these three challenges. Applications include parameterized verification and shape analysis of heap structures.


Abstract interpretation Graph transformation systems Parameterized verification Shape analysis Tools 



We thank Dmytro Puzhay for assistance with the implementation work and Jörg Bauer-Kreiker for providing his hiralysis test cases. Conny Clausen managed copyright clearance with Saarland University to obtain permission for releasing the tool under a Free Software license. Reinhard Wilhelm provided valuable comments for a draft version of this paper.


  1. 1.
    Backes, P.: dcs2gts - An interface between XML-coded DCS protocols and the hiralysis representation of graph transformation grammars. Fopra report, Saarland University, January 2007Google Scholar
  2. 2.
    Backes, P., Reineke, J.: Abstract topology analysis of the join phase of the merge protocol. In: TTC 2010, CTIT Workshop Proceedings, vol. WP10-03, pp. 127–133. University of Twente, Enschede (2010)Google Scholar
  3. 3.
    Backes, P., Reineke, J.: Analysis of infinite-state graph transformation systems by cluster abstraction. In: D’Souza, D., Lal, A., Larsen, K.G. (eds.) VMCAI 2015. LNCS, vol. 8931, pp. 135–152. Springer, Heidelberg (2015) Google Scholar
  4. 4.
    Bauer, J., Schaefer, I., Toben, T., Westphal, B.: Specification and verification of dynamic communication systems. In: ACSD 2006, pp. 189–200 (2006)Google Scholar
  5. 5.
    Bauer, J.: Analysis of Communication Topologies by Partner Abstraction. Ph.D. thesis, Saarland University (2006)Google Scholar
  6. 6.
    Bauer, J., Toben, T., Westphal, B.: Mind the shapes: Abstraction refinement via topology invariants. Technical report 22, SFB/TR 14 AVACS, June 2007Google Scholar
  7. 7.
    König, B., Kozioura, V.: Augur 2–a new version of a tool for the analysis of graph transformation systems. In: Bruni, R., Varró, D. (eds.) GT-VMT 2006, ENTCS, vol. 2011, pp. 201–210 (2008)Google Scholar
  8. 8.
    Rakow, J.: Verification of Dynamic Communication Systems. Diploma thesis, Carl-von-Ossietzky Universität Oldenburg, April 2006Google Scholar
  9. 9.
    Zambon, E.: Abstract graph transformation : theory and practice. Ph.D. thesis, University of Twente (2013)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Universität des SaarlandesSaarbrückenGermany

Personalised recommendations