Transitive Closures of Regular Relations for Verifying Infinite-State Systems
Abstract elided by the publisher.
Related papers
- Verifying Systems with Infinite but Regular State Spaces CAV 1998
- Probabilistic Bisimulation for Parameterized Systems - (with Applications to Verifying Anonymous Protocols) CAV 2019
- Iterating Transducers in the Large (Extended Abstract) CAV 2003
- Context-Free-Language Reachability for Almost-Commuting Transition Systems POPL 2026
- Temporal verification of higher-order functional programs POPL 2016
- Reducing liveness to safety in first-order logic POPL 2018
- Verifying Parameterized Networks TOPLAS 1997
- Transitive Closures of Affine Integer Tuple Relations and Their Overapproximations SAS 2011