Fast Mu-Calculus Model Checking when Tree-Width Is Bounded
Abstract elided by the publisher.
Related papers
- Algebraic construction of graphs with bounded tree width and its applications - Catamorphic Approach to Program Analyses APLAS 2002
- Certified Decision Procedures for Width-Independent Bitvector Predicates OOPSLA 2025
- The tree width of auxiliary storage POPL 2011
- State Space Estimation for DPOR-Based Model Checkers PLDI 2026
- The Bounded Pathwidth of Control-Flow Graphs OOPSLA 2023
- Fast: a transducer-based language for tree manipulation PLDI 2014
- The Complex(ity) Landscape of Checking Infinite Descent POPL 2024
- Fast and flexible instruction selection with constraints CC 2018