Computer Aided Verification
From MaRDI portal
Publication:5900672
DOI10.1007/b11831zbMath1278.68188OpenAlexW1571340194MaRDI QIDQ5900672
Publication date: 20 April 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11831
Graph theory (including graph drawing) in computer science (68R10) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
The Theory of Universal Graphs for Infinite Duration Games ⋮ Symmetric Strategy Improvement ⋮ $\aleph_1$ and the modal $\mu$-calculus ⋮ From Parity and Payoff Games to Linear Programming ⋮ Solving parity games in big steps ⋮ Jumping robbers in digraphs ⋮ Pushdown reachability with constant treewidth ⋮ Alternating traps in Muller and parity games ⋮ Parameterized Algorithms for Parity Games ⋮ Entanglement and the complexity of directed graphs ⋮ Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games ⋮ Efficient interprocedural data-flow analysis using treedepth and treewidth ⋮ Fixpoint logics over hierarchical structures ⋮ Graph operations on parity games and polynomial-time algorithms ⋮ The dag-width of directed graphs ⋮ Digraph width measures in parameterized algorithmics ⋮ Parity games on undirected graphs ⋮ The Descriptive Complexity of Parity Games ⋮ The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs ⋮ Solving parity games via priority promotion ⋮ New deterministic algorithms for solving parity games ⋮ Solving Parity Games in Big Steps ⋮ Faster algorithms for quantitative verification in bounded treewidth graphs ⋮ On Digraph Width Measures in Parameterized Algorithmics
