Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345MaRDI QIDQ5492896zbMATH OpenOpenAlexFDO

Authors Martin Lange, Rafał Somla

Publication date 20 October 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11549345

Mathematics Subject Classification ID

Logic in computer science (03B70) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• The Complexity of Model Checking Higher-Order Fixpoint Logic
• The complexity of model-checking tail-recursive higher-order fixpoint logic
• Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic
• On the complexity of the model checking problem
• Complexity of model checking for logics over Kripke models
• Complexity of model checking for modal dependence logic
• The complexity of model checking for circumscriptive formulae
• Higher-order model checking: an overview
• The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions

Cited in

(17)

• Computable fixpoints in well-structured symbolic model checking
• Complexity of model checking for cardinality-based belief revision operators
• Fixpoint logics over hierarchical structures
• A ZDD-Based Efficient Higher-Order Model Checking Algorithm
• Finitary semantics of linear logic and higher-order model-checking
• Capturing bisimulation-invariant complexity classes with higher-order modal fixpoint logic
• The descriptive complexity of modal model-checking games
• The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions
• The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey
• The complexity of model-checking tail-recursive higher-order fixpoint logic
• scientific article; zbMATH DE number 7297868 (Why is no real title available?)
• The Complexity of Model Checking Higher-Order Fixpoint Logic
• CONCUR 2004 - Concurrency Theory
• Complexity of model-checking call-by-value programs
• Three notes on the complexity of model checking fixpoint logic with chop
• Model-checking the higher-dimensional modal -calculus
• LambdaY-calculus with priorities

This page was built for publication: Mathematical Foundations of Computer Science 2005

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