2026-07-23T00:18:37Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:7732 2024-03-06T10:41:05Z ddc:004 open_access

Streett Automata Model Checking of Higher-Order Recursion Schemes Suzuki, Ryota Fujima, Koichi Kobayashi, Naoki Tsukada, Takeshi Higher-order model checking higher-order recursion schemes Streett automata We propose a practical algorithm for Streett automata model checking of higher-order recursion schemes (HORS), which checks whether the tree generated by a given HORS is accepted by a given Streett automaton. The Streett automata model checking of HORS is useful in the context of liveness verification of higher-order functional programs. The previous approach to Streett automata model checking converted Streett automata to parity automata and then invoked a parity tree automata model checker. We show through experiments that our direct approach outperforms the previous approach. Besides being able to directly deal with Streett automata, our algorithm is the first practical Streett or parity automata model checking algorithm that runs in time polynomial in the size of HORS, assuming that the other parameters are fixed. Previous practical fixed-parameter polynomial time algorithms for HORS could only deal with the class of trivial tree automata. We have confirmed through experiments that (a parity automata version of) our model checker outperforms previous parity automata model checkers for HORS. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Ryota Suzuki and Koichi Fujima and Naoki Kobayashi and Takeshi Tsukada 2017 Is Part Of LIPIcs, Volume 84, 2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSCD.2017.32 urn:nbn:de:0030-drops-77325 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2017.32 eng https://creativecommons.org/licenses/by/3.0/legalcode