On Automatically Explaining Bisimulation Inequivalence
Abstract elided by the publisher.
Related papers
- From Bounded Checking to Verification of Equivalence via Symbolic Up-to Techniques TACAS 2022
- Detecting and Explaining (In-)equivalence of Context-Free Grammars OOPSLA 2025
- Bisimulation Can't Be Traced POPL 1988
- Probabilistic Bisimulation for Parameterized Systems - (with Applications to Verifying Anonymous Protocols) CAV 2019
- Checking equivalence in a non-strict language OOPSLA 2022
- Checking equivalence in a non-strict language JFP 2025
- QSOLE: Automatic QBF Equivalence Checking TACAS 2026
- Trustworthy Runtime Verification via Bisimulation (Experience Report) ICFP 2023