Verification of tree-processing programs via higher-order mode checking

DOI10.1017/S0960129513000054zbMath1361.68152OpenAlexW2002702549MaRDI QIDQ5740641

Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno

Publication date: 27 July 2016

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129513000054

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Flow analysis of lazy higher-order functional programs
• Macro tree transducers
• High level tree transducers and iterated pushdown tree transducers
• Typechecking for XML transformers
• Regular expression types for XML
• XML Type Checking Using High-Level Tree Transducer
• Higher-order multi-parameter tree transducers and recursion schemes for program verification
• CDuce
• Verifying higher-order functional programs with pattern-matching algebraic data types

This page was built for publication: Verification of tree-processing programs via higher-order mode checking