The following pages link to (Q4551162):
Displaying 26 items.
- Efficient CTL model-checking for pushdown systems (Q402129) (← links)
- A model checking-based approach for security policy verification of mobile systems (Q432137) (← links)
- SMT-based model checking for recursive programs (Q518396) (← links)
- Summarization for termination: No return! (Q845247) (← links)
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
- Automatic verification of recursive procedures with one integer parameter. (Q1401233) (← links)
- Pushdown timed automata: A binary reachability characterization and safety verification. (Q1401320) (← links)
- Analyzing pushdown systems with stack manipulation (Q1706143) (← links)
- Model checking LTL with regular valuations for pushdown systems (Q1887158) (← links)
- Verifying parallel programs with dynamic communication structures (Q1959654) (← links)
- Faster pushdown reachability analysis with applications in network verification (Q2147193) (← links)
- Multi-matching nested relations (Q2220863) (← links)
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577) (← links)
- Verification of Boolean programs with unbounded thread creation (Q2464944) (← links)
- Towards Completeness in Bounded Model Checking Through Automatic Recursion Depth Detection (Q2797866) (← links)
- Efficient CTL Model-Checking for Pushdown Systems (Q3090847) (← links)
- Model Checking Procedural Programs (Q3176375) (← links)
- Model Checking Concurrent Programs (Q3176376) (← links)
- Complete SAT-Based Model Checking for Context-Free Processes (Q3510785) (← links)
- Model Checking Recursive Programs with Exact Predicate Abstraction (Q3540067) (← links)
- An Automata-Theoretic Approach to Infinite-State Systems (Q3587257) (← links)
- Verifying Parallel Programs with Dynamic Communication Structures (Q3637351) (← links)
- View abstraction -- a tutorial (invited paper) (Q5240148) (← links)
- A Branching Time Variant of CaRet (Q5883579) (← links)
- Regular model checking: evolution and perspectives (Q6045027) (← links)
- Verification of programs with exceptions through operator precedence automata (Q6045058) (← links)