Local higher-order fixpoint iteration

DOI10.1016/j.ic.2022.104963OpenAlexW4295736098MaRDI QIDQ2105477

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

Publication date: 8 December 2022

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2022.104963

zbMATH Keywords

model checkingabstract interpretationhigher-order functionsfixpoint iteration

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• TVLA

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Local higher-order fixpoint iteration