Checking Bounded Reachability in Asynchronous Systems by Symbolic Event Tracing
No abstract available.
Related papers
- Bounded Reachability Checking of Asynchronous Systems Using Decision Diagrams TACAS 2007
- Verifying Asynchronous Event-Driven Programs Using Partial Abstract Transformers CAV 2019
- Bounded Model Checking for Asynchronous Hyperproperties TACAS 2023
- Symbolic Optimal Reachability in Weighted Timed Automata CAV 2016
- A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation CAV 2023
- Verifying Asynchronous Interactions via Communicating Session Automata CAV 2019
- Structural Symbolic CTL Model Checking of Asynchronous Systems CAV 2003
- Characterizing Implementability of Global Protocols with Infinite States and Data OOPSLA 2025