On the Verification of the Correctness of a Subgraph Construction Algorithm
Abstract elided by the publisher.
Related papers
- Attracting Tangles to Solve Parity Games CAV 2018
- Stencil-Lifting: Hierarchical Recursive Lifting System for Extracting Summary of Stencil Kernel in Legacy Codes OOPSLA 2025
- A scalable distance-1 vertex coloring algorithm for power-law graphs PPoPP 2018
- Exploiting Narrow Accelerators with Data-Centric Subgraph Mapping CGO 2007
- Reverse If-Conversion PLDI 1993
- Qubit allocation as a combination of subgraph isomorphism and token swapping OOPSLA 2019
- Verifying Graph Algorithms in Separation Logic: A Case for an Algebraic Approach ICFP 2025
- A constructive formalization of the weak perfect graph theorem CPP 2020