A Verification Procedure via Invariant for Extended Communicating Finite-State Machines
No abstract available.
Related papers
- Adding Liveness Properties to Coupled Finite-State Machines TOPLAS 1990
- Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications TOPLAS 1986
- A Unified Approach to the Deadlock Detection Problem in Networks of Communicating Finite State Machines CAV 1990
- Reachability and Recurrence in Extended Finite State Machines: Modular Vector Addition Systems CAV 1993
- TRANSIT: specifying protocols with concolic snippets PLDI 2013
- Generating Local Address and Communication Sets for Data-Parallel Programs PPoPP 1993
- An Infinite Needle in a Finite Haystack: Finding Infinite Counter-Models in Deductive Verification POPL 2024
- Data Flow Analysis of Communicating Finite State Machines TOPLAS 1991