Similar Items: Invariant Generation through Strategy Iteration in Succinctly Represented Control Flow Graphs
- Hardness of monadic second-order formulae over succinct graphs
- Succinct Graph Representations and Algorithmic Applications
- On the Succinctness of Atoms of Dependency
- The succinctness of first-order logic on linear orders
- Coupling policy iteration with semi-definite relaxation to compute accurate numerical invariants in static analysis
- Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees