The following pages link to (Q2754086):
Displayed 21 items.
- Turing machines, transition systems, and interaction (Q703844) (← links)
- Summarization for termination: No return! (Q845247) (← links)
- Decidability issues for extended ping-pong protocols (Q861694) (← links)
- Compositional verification of sequential programs with procedures (Q937300) (← links)
- Verification and falsification of programs with loops using predicate abstraction (Q968302) (← links)
- Note on winning positions on pushdown games with \(\omega\)-regular conditions (Q1007544) (← links)
- Automatic verification of recursive procedures with one integer parameter. (Q1401233) (← links)
- The complexity of bisimilarity-checking for one-counter processes. (Q1401395) (← links)
- Eliminating the storage tape in reachability constructions. (Q1874416) (← links)
- Model checking LTL with regular valuations for pushdown systems (Q1887158) (← links)
- Complexity results on branching-time pushdown model checking (Q2373715) (← links)
- Model checking for process rewrite systems and a class of action-based regular properties (Q2503332) (← links)
- Complexity results for prefix grammars (Q3025324) (← links)
- Efficient CTL Model-Checking for Pushdown Systems (Q3090847) (← links)
- Invariant Checking for Programs with Procedure Calls (Q3392933) (← links)
- The Reachability Problem over Infinite Graphs (Q3392937) (← links)
- Unary Automatic Graphs: An Algorithmic Perspective (Q3502677) (← links)
- Complete SAT-Based Model Checking for Context-Free Processes (Q3510785) (← links)
- An Automata-Theoretic Approach to Infinite-State Systems (Q3587257) (← links)
- Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains (Q3617746) (← links)
- Program Analysis Using Weighted Pushdown Systems (Q5458821) (← links)