scientific article; zbMATH DE number 7455743

MaRDI QIDQ5021005

Martin Lange, Marco Sälzer, Florian Bruse, Jörg Kreiker

Publication date: 11 January 2022

Full work available at URL: https://arxiv.org/abs/2009.10881

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

The tail-recursive fragment of timed recursive CTL

Uses Software

• TVLA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Results on the propositional \(\mu\)-calculus
• Strictness analysis for higher-order functions
• Space-efficient fragments of higher-order fixpoint logic
• A lattice-theoretical fixpoint theorem and its applications
• Temporal Logics in Computer Science
• Conjunctive Visibly-Pushdown Path Queries
• Saturation-Based Model Checking of Higher-Order Recursion Schemes.
• Formal Language Constrained Reachability and Model Checking Propositional Dynamic Logics
• Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic
• Formal-Language-Constrained Path Problems
• An even faster solver for general systems of equations
• 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
• On notation for ordinal numbers
• Tools and Algorithms for the Construction and Analysis of Systems

This page was built for publication: