The following pages link to Computer Aided Verification (Q5312916):
Displaying 15 items.
- Efficient CTL model-checking for pushdown systems (Q402129) (← links)
- A saturation method for the modal \(\mu \)-calculus over pushdown systems (Q532393) (← links)
- Model-checking structured context-free languages (Q832277) (← links)
- Uniform strategies, rational relations and jumping automata (Q2346407) (← links)
- Complexity results on branching-time pushdown model checking (Q2373715) (← links)
- (Q2723916) (← links)
- Global model checking of ordered multi-pushdown systems (Q2908851) (← links)
- Efficient CTL Model-Checking for Pushdown Systems (Q3090847) (← links)
- Model Checking Procedural Programs (Q3176375) (← links)
- Winning Regions of Pushdown Parity Games: A Saturation Method (Q3184687) (← links)
- An Automata-Theoretic Approach to Infinite-State Systems (Q3587257) (← links)
- Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems (Q3608784) (← links)
- On Global Model Checking Trees Generated by Higher-Order Recursion Schemes (Q3617724) (← links)
- (Q5005144) (← links)
- Generalization strategies for the verification of infinite state systems (Q5299583) (← links)