Using Optimal Simulations to Reduce Reachability Graphs
Abstract elided by the publisher.
Related papers
- Fast Client-Driven CFL-Reachability via Regularization-Based Graph Simplification OOPSLA 2025
- Lifetime-Based Optimization for Simulating Quantum Circuits on a New Sunway Supercomputer PPoPP 2023
- Recursive State Machine Guided Graph Folding for Context-Free Language Reachability PLDI 2023
- NeuReach: Learning Reachability Functions from Simulations TACAS 2022
- Iterative-Epoch Online Cycle Elimination for Context-Free Language Reachability OOPSLA 2024
- DryVR: Data-Driven Verification and Compositional Reasoning for Automotive Systems CAV 2017
- Cache Behavior of Combinator Graph Reduction TOPLAS 1992
- Automatic GPU memory management for large neural models in TensorFlow ISMM 2019