Automata-Based Abstraction for Automated Verification of Higher-Order Tree-Processing Programs
Abstract elided by the publisher.
Related papers
- Verification of Tree-Processing Programs via Higher-Order Model Checking APLAS 2010
- Fully Automated Shape Analysis Based on Forest Automata CAV 2013
- Regular language type inference with term rewriting ICFP 2020
- Practical Alternating Parity Tree Automata Model Checking of Higher-Order Recursion Schemes APLAS 2013
- Higher-order multi-parameter tree transducers and recursion schemes for program verification POPL 2010
- Verifying Quantum Circuits with Level-Synchronized Tree Automata POPL 2025
- Temporal verification of higher-order functional programs POPL 2016
- Automatically disproving fair termination of higher-order functional programs ICFP 2016