Higher-order multi-parameter tree transducers and recursion schemes for program verification
DOI10.1145/1706299.1706355zbMATH Open1312.68136OpenAlexW1994090338MaRDI QIDQ5255106FDOQ5255106
Authors: Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno 
Publication date: 11 June 2015
Published in: Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1706299.1706355
Recommendations
program verificationhigher-order recursion schemehigher-order tree transducerstree-processing programs
Formal languages and automata (68Q45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (16)
- Counterexample-guided partial bounding for recursive function synthesis
- Title not available (Why is that?)
- Verification of tree-processing programs via higher-order mode checking
- Pattern eliminating transformations
- Lifting numeric relational domains to algebraic data types
- Temporal refinements for guarded recursive types
- Typing Weak MSOL Properties
- Partial bounding for recursive function synthesis
- Verified Operational Transformation for Trees
- Title not available (Why is that?)
- Backward type inference for XML queries
- Termination criteria for tree automata completion
- Higher order symbolic execution for contract verification and refutation
- Title not available (Why is that?)
- Streett Automata Model Checking of Higher-Order Recursion Schemes
- Modular Verification of Higher-Order Functional Programs
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)
