A type-based HFL model checking algorithm

DOI10.1007/978-3-030-34175-6_8zbMATH Open1542.68097MaRDI QIDQ6536312

Naoki Kobayashi, Youkichi Hosoi, Takeshi Tsukada

Publication date: 19 April 2024

Mathematics Subject Classification ID

Could not fetch data.

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Model-checking process equivalences
• Automata, logics, and infinite games. A guide to current research
• Higher-order program verification via HFL model checking
• Saturation-Based Model Checking of Higher-Order Recursion Schemes.
• Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic
• Streett Automata Model Checking of Higher-Order Recursion Schemes
• The Complexity of Model Checking Higher-Order Fixpoint Logic
• CONCUR 2004 - Concurrency Theory
• On the relationship between higher-order recursion schemes and higher-order fixpoint logic
• A type-directed abstraction refinement approach to higher-order model checking

Related Items (2)

Model checking timed recursive CTL ⋮ An overview of the HFL model checking project

This page was built for publication: A type-based HFL model checking algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536312)