ASTRA: A Tool for Abstract Interpretation of Graph Transformation Systems [chapter]

Peter Backes, Jan Reineke
2015 Lecture Notes in Computer Science  
We describe ASTRA (see ∼ 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, or
more » ... fer 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.
doi:10.1007/978-3-319-23404-5_2 fatcat:fybq2rurvjdk5lnwepgaptbyvi