The following pages link to (Q4847017):
Displaying 9 items.
- Efficient CTL model-checking for pushdown systems (Q402129) (← links)
- A model checking-based approach for security policy verification of mobile systems (Q432137) (← links)
- A saturation method for the modal \(\mu \)-calculus over pushdown systems (Q532393) (← links)
- Decidability of bisimulation equivalence for normed pushdown processes (Q1276237) (← links)
- Model checking of systems with many identical timed processes (Q1853589) (← links)
- Model checking the full modal mu-calculus for infinite sequential processes (Q1960527) (← links)
- Complexity results on branching-time pushdown model checking (Q2373715) (← links)
- Verification of Boolean programs with unbounded thread creation (Q2464944) (← links)
- Efficient CTL Model-Checking for Pushdown Systems (Q3090847) (← links)
