Practical Alternating Parity Tree Automata Model Checking of Higher-Order Recursion Schemes

DOI10.1007/978-3-319-03542-0_2zbMath1426.68171OpenAlexW156616570MaRDI QIDQ2937780

Koichi Fujima, Sohei Ito, Naoki Kobayashi

Publication date: 12 January 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-319-03542-0_2

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (4)

Unnamed Item ⋮ Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems ⋮ Temporal refinements for guarded recursive types ⋮ Streett Automata Model Checking of Higher-Order Recursion Schemes

This page was built for publication: Practical Alternating Parity Tree Automata Model Checking of Higher-Order Recursion Schemes