The Complexity of Model Checking Higher-Order Fixpoint Logic

DOI10.2168/LMCS-3(2:7)2007zbMath1128.68051MaRDI QIDQ5310692

Martin Lange, Rafał Somla, Roland Axelsson

Publication date: 11 October 2007

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Temporal logic (03B44)

Related Items (10)

Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Model-checking process equivalences ⋮ Temporal Logic with Recursion. ⋮ Temporal logic with recursion ⋮ The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic ⋮ Local higher-order fixpoint iteration

This page was built for publication: The Complexity of Model Checking Higher-Order Fixpoint Logic