Model Checking on Trees with Path Equivalences
Abstract elided by the publisher.
Related papers
- Equivalence Checking of Quantum Circuits via Path-Sum and Weighted Model Counting TACAS 2026
- Paths vs. Trees in Set-Based Program Analysis POPL 2000
- Software model checking using languages of nested trees TOPLAS 2011
- State Space Estimation for DPOR-Based Model Checkers PLDI 2026
- Heap-Snapshot Matching and Ordering using CAHPs: A Context-Augmented Heap-Path Representation for Exact and Partial Path Matching using Prefix Trees OOPSLA 2025
- Efficient static analysis of XML paths and types PLDI 2007
- Efficient nondestructive equality checking for trees and graphs ICFP 2008
- Fast: a transducer-based language for tree manipulation PLDI 2014