A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes

DOI10.1007/978-3-642-19805-2_18zbMath1326.68187OpenAlexW1549097197MaRDI QIDQ3000614

Naoki Kobayashi

Publication date: 19 May 2011

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19805-2_18

Mathematics Subject Classification ID

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

Related Items (6)

Recursion Schemes and the WMSO+U Logic ⋮ Cost Automata, Safe Schemes, and Downward Closures ⋮ Simply typed fixpoint calculus and collapsible pushdown automata ⋮ Functional programs as compressed data ⋮ Unnamed Item ⋮ Streett Automata Model Checking of Higher-Order Recursion Schemes

Uses Software

• BLAST
• SLAM

This page was built for publication: A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes