Automata-Based Abstraction for Automated Verification of Higher-Order Tree-Processing Programs

DOI10.1007/978-3-319-26529-2_16zbMath1329.68065OpenAlexW2397687371MaRDI QIDQ3459423

Hiroshi Unno, Naoki Kobayashi, Yuma Matsumoto

Publication date: 8 January 2016

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-26529-2_16

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Functional programming and lambda calculus (68N18) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (2)

Unnamed Item ⋮ Modular Verification of Higher-Order Functional Programs

This page was built for publication: Automata-Based Abstraction for Automated Verification of Higher-Order Tree-Processing Programs