An Automated Proof Technique for Finite-State Machine Equivalence
Abstract elided by the publisher.
Related papers
- Automating Bitvector and Finite Field Equivalence Proofs in Lean CAV 2026
- A Distributed Alternative to Finite-State-Machine Specifications TOPLAS 1985
- Proving Liveness for Networks of Communicating Finite State Machines TOPLAS 1986
- Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications TOPLAS 1986
- Automating Equational Proofs in Dirac Notation POPL 2025
- A Logical Treatment of Finite Automata TACAS 2024
- Trace abstraction modulo probability POPL 2019
- Automated Parameterized Verification of a Railway Protection System with Dafny CAV 2025