The following pages link to (Q2754086):
Displayed 50 items.
- Reducing behavioural to structural properties of programs with procedures (Q385023) (← links)
- Efficient CTL model-checking for pushdown systems (Q402129) (← links)
- SMT-based model checking for recursive programs (Q518396) (← links)
- Turing machines, transition systems, and interaction (Q703844) (← links)
- Reachability problems on reliable and lossy queue automata (Q825976) (← links)
- Model-checking structured context-free languages (Q832277) (← 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)
- Analyzing pushdown systems with stack manipulation (Q1706143) (← links)
- Model checking properties on reduced trace systems (Q1736621) (← links)
- Eliminating the storage tape in reachability constructions. (Q1874416) (← links)
- Model checking LTL with regular valuations for pushdown systems (Q1887158) (← links)
- Detecting useless transitions in pushdown automata (Q2042722) (← links)
- Reactive synthesis from visibly register pushdown automata (Q2119985) (← links)
- Model checking interval temporal logics with regular expressions (Q2182727) (← links)
- Operator precedence temporal logic and model checking (Q2215961) (← links)
- Analyzing probabilistic pushdown automata (Q2248071) (← links)
- Model checking dynamic pushdown networks (Q2355386) (← links)
- Complexity results on branching-time pushdown model checking (Q2373715) (← links)
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577) (← links)
- Model checking for process rewrite systems and a class of action-based regular properties (Q2503332) (← links)
- Automated formal analysis and verification: an overview (Q2871577) (← links)
- Complexity results for prefix grammars (Q3025324) (← links)
- Efficient CTL Model-Checking for Pushdown Systems (Q3090847) (← links)
- Model Checking Procedural Programs (Q3176375) (← 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)
- Turing Machines, Transition Systems, and Interaction (Q4917087) (← links)
- CaRet With Forgettable Past (Q4982130) (← links)
- Static Analysis of Multithreaded Recursive Programs Communicating via Rendez-Vous (Q5056000) (← links)
- (Q5092412) (← links)
- (Q5101344) (← links)
- Program Analysis Using Weighted Pushdown Systems (Q5458821) (← links)
- Efficient Analysis of Probabilistic Programs with an Unbounded Counter (Q5501946) (← links)
- Detecting Useless Transitions in Pushdown Automata (Q5739015) (← links)
- Reachability Analysis of Pushdown Systems with an Upper Stack (Q5739017) (← links)
- Model-Checking HyperLTL for Pushdown Systems (Q5883578) (← links)
- A Branching Time Variant of CaRet (Q5883579) (← links)
- Verification of programs with exceptions through operator precedence automata (Q6045058) (← links)
- LTL model checking of self modifying code (Q6102164) (← links)
- The complexity gap in the static analysis of cache accesses grows if procedure calls are added (Q6108428) (← links)