Higher-order multi-parameter tree transducers and recursion schemes for program verification
From MaRDI portal
Publication:5255106
Recommendations
Cited in
(15)- Temporal refinements for guarded recursive types
- Termination criteria for tree automata completion
- Counterexample-guided partial bounding for recursive function synthesis
- Higher order symbolic execution for contract verification and refutation
- Pattern eliminating transformations
- Verification of tree-processing programs via higher-order model checking
- scientific article; zbMATH DE number 7559409 (Why is no real title available?)
- scientific article; zbMATH DE number 5529981 (Why is no real title available?)
- Streett Automata Model Checking of Higher-Order Recursion Schemes
- Reachability analysis of innermost rewriting
- Lifting numeric relational domains to algebraic data types
- Partial bounding for recursive function synthesis
- Modular verification of higher-order functional programs
- Verified Operational Transformation for Trees
- Backward type inference for XML queries
This page was built for publication: Higher-order multi-parameter tree transducers and recursion schemes for program verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5255106)