Higher-order multi-parameter tree transducers and recursion schemes for program verification

DOI10.1145/1706299.1706355zbMath1312.68136OpenAlexW1994090338MaRDI QIDQ5255106

Hiroshi Unno, Naoshi Tabuchi, Naoki Kobayashi

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

zbMATH Keywords

program verificationhigher-order recursion schemehigher-order tree transducerstree-processing programs

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (13)

Unnamed Item ⋮ Counterexample-guided partial bounding for recursive function synthesis ⋮ Backward type inference for XML queries ⋮ Typing Weak MSOL Properties ⋮ Lifting numeric relational domains to algebraic data types ⋮ Higher order symbolic execution for contract verification and refutation ⋮ Modular Verification of Higher-Order Functional Programs ⋮ Temporal refinements for guarded recursive types ⋮ Verification of tree-processing programs via higher-order mode checking ⋮ Unnamed Item ⋮ Termination criteria for tree automata completion ⋮ Streett Automata Model Checking of Higher-Order Recursion Schemes ⋮ Pattern eliminating transformations

This page was built for publication: Higher-order multi-parameter tree transducers and recursion schemes for program verification