Algebraic construction of graphs with bounded tree width and its applications - Catamorphic Approach to Program Analyses
No abstract available.
Related papers
- The tree width of auxiliary storage POPL 2011
- Structural recursion for querying ordered graphs ICFP 2013
- Fast Mu-Calculus Model Checking when Tree-Width Is Bounded CAV 2003
- Automated Catamorphism Synthesis for Solving Constrained Horn Clauses over Algebraic Data Types SAS 2025
- Decision procedures for algebraic data types with abstractions POPL 2010
- The Bounded Pathwidth of Control-Flow Graphs OOPSLA 2023
- A Note on Algebraic Structure of Tree Decomposition of Graphs APLAS 2000
- Revisiting Catamorphisms over Datatypes with Embedded Functions (or, Programs from Outer Space) POPL 1996