The following pages link to (Q4223067):
Displaying 31 items.
- A saturation method for the modal \(\mu \)-calculus over pushdown systems (Q532393) (← links)
- Probabilistic contracts: a compositional reasoning methodology for the design of systems with stochastic and/or non-deterministic aspects (Q633299) (← links)
- Reachability problems on reliable and lossy queue automata (Q825976) (← links)
- Model-checking structured context-free languages (Q832277) (← links)
- An efficient automata approach to some problems on context-free grammars. (Q930285) (← links)
- Verification in loosely synchronous queue-connected discrete timed automata. (Q1401187) (← links)
- Pushdown timed automata: A binary reachability characterization and safety verification. (Q1401320) (← links)
- Pushdown reachability with constant treewidth (Q1675921) (← links)
- Iterating transducers (Q1858440) (← links)
- Eliminating the storage tape in reachability constructions. (Q1874416) (← links)
- Model checking LTL with regular valuations for pushdown systems (Q1887158) (← links)
- Verifying parallel programs with dynamic communication structures (Q1959654) (← links)
- Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations (Q1960526) (← links)
- CTL* model checking for data-aware dynamic systems with arithmetic (Q2104496) (← links)
- Faster pushdown reachability analysis with applications in network verification (Q2147193) (← links)
- Complexity results on branching-time pushdown model checking (Q2373715) (← links)
- Random Generation and Enumeration of Accessible Deterministic Real-Time Pushdown Automata (Q2947417) (← links)
- Normalization of Linear Horn Clauses (Q2999324) (← links)
- Efficient CTL Model-Checking for Pushdown Systems (Q3090847) (← links)
- SAT-Based Model Checking (Q3176368) (← links)
- Model Checking Procedural Programs (Q3176375) (← links)
- Winning Regions of Pushdown Parity Games: A Saturation Method (Q3184687) (← links)
- Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems (Q3623010) (← links)
- Verifying Parallel Programs with Dynamic Communication Structures (Q3637351) (← links)
- (Q5005144) (← links)
- Domains for Higher-Order Games (Q5111275) (← links)
- An Automata-based Approach for CTL⋆ With Constraints (Q5179062) (← links)
- Interprocedural Analysis of Concurrent Programs Under a Context Bound (Q5458333) (← links)
- Program Analysis Using Weighted Pushdown Systems (Q5458821) (← links)
- Detecting Useless Transitions in Pushdown Automata (Q5739015) (← links)
- The regular viewpoint on PA-processes (Q5958465) (← links)
