A type-based HFL model checking algorithm
type: Item
instance of: scholarly article
title: A type-based HFL model checking algorithm
zbMATH Open document ID: 1542.68097
DOI: 10.1007/978-3-030-34175-6_8
author: Youkichi Hosoi
author: Naoki Kobayashi
author: Takeshi Tsukada
publication date: 2024-04-19T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 03B45
zbMATH DE Number: 7834968
MaRDI profile type: MaRDI publication profile
cites work: Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic
cites work: The Complexity of Model Checking Higher-Order Fixpoint Logic
cites work: Q3077958
cites work: Saturation-Based Model Checking of Higher-Order Recursion Schemes.
cites work: Automata, logics, and infinite games. A guide to current research
cites work: Q4501540
cites work: On the relationship between higher-order recursion schemes and higher-order fixpoint logic
cites work: Higher-order program verification via HFL model checking
cites work: Model-checking process equivalences
cites work: Q5014448
cites work: A type-directed abstraction refinement approach to higher-order model checking
cites work: Streett Automata Model Checking of Higher-Order Recursion Schemes
cites work: CONCUR 2004 - Concurrency Theory
description: scientific article; zbMATH DE number 7834968