A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We describe ASTRA (see http://rw4.cs.uni-saarland.de/ ∼ rtc/ astra/), 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, ordoi:10.1007/978-3-319-23404-5_2 fatcat:fybq2rurvjdk5lnwepgaptbyvi