Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic
From MaRDI portal
Recommendations
Cites work
- Antichains: A New Algorithm for Checking Universality of Finite Automata
- BDD-based decision procedures for the modal logic K ★
- CONCUR 2004 - Concurrency Theory
- Experimental Evaluation of Classical Automata Constructions
- scientific article; zbMATH DE number 1304336 (Why is no real title available?)
- The Complexity of Model Checking Higher-Order Fixpoint Logic
- Tools and Algorithms for the Construction and Analysis of Systems
- Uniform inevitability is tree automaton ineffable
Cited in
(10)- Local higher-order fixpoint iteration
- Verification of non-regular program properties
- The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey
- Model-Checking First-Order Logic: Automata and Locality
- Model-checking process equivalences
- The complexity of model-checking tail-recursive higher-order fixpoint logic
- scientific article; zbMATH DE number 7455743 (Why is no real title available?)
- The Complexity of Model Checking Higher-Order Fixpoint Logic
- Mathematical Foundations of Computer Science 2005
- A type-based HFL model checking algorithm
This page was built for publication: Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3498457)