Model Checking Linear Properties of Prefix-Recognizable Systems
No abstract available.
Related papers
- Model-Checking Linear-Time Properties of Parametrized Asynchronous Shared-Memory Pushdown Systems CAV 2017
- Compositional Verification of Timed Automata via Violation Assumptions CAV 2026
- BFS-Based Model Checking of Linear-Time Properties with an Application on GPUs CAV 2016
- Efficient Decision Procedures for Model Checking of Linear Time Logic Properties CAV 1999
- Model Checking Matrix Product States Against Linear Chain Logic CAV 2026
- Programs with Quasi-Stable Channels are Effectively Recognizable (Extended Abstract) CAV 1997
- Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi SAS 2002
- Invariant Checking of NRA Transition Systems via Incremental Reduction to LRA with EUF TACAS 2017