Analysis of Infinite-State Graph Transformation Systems by Cluster Abstraction
Abstract elided by the publisher.
Related papers
- Directed Reachability for Infinite-State Systems TACAS 2021
- Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis CAV 1999
- Counterexample-Guided Abstraction Refinement for the Analysis of Graph Transformation Systems TACAS 2006
- Sound Verification Procedures for Temporal Properties of Infinite-State Systems CAV 2021
- An Automaton Learning Approach to Solving Safety Games over Infinite Graphs TACAS 2016
- Abstract Symbolic Automata: Mixed syntactic/semantic similarity analysis of executables POPL 2015
- POSTER: ParGNN: Efficient Training for Large-Scale Graph Neural Network on GPU Clusters PPoPP 2024
- A Forward Analysis for Recurrent Sets SAS 2015