Local higher-order fixpoint iteration

DOI10.1016/J.IC.2022.104963MaRDI QIDQ2105477zbMATH OpenOpenAlexFDO

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

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

abstract interpretationfixpoint iterationhigher-order functionsmodel checking

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• scientific article; zbMATH DE number 7455743
• scientific article; zbMATH DE number 512902
• Publication:3026317
• Bounded Fixed-Point Iteration
• Approximate fixed points in abstract interpretation

Cites work

• A lattice-theoretical fixpoint theorem and its applications
• A type-directed abstraction refinement approach to higher-order model checking
• An even faster solver for general systems of equations
• CONCUR 2004 - Concurrency Theory
• Conjunctive visibly-pushdown path queries
• Formal language constrained reachability and model checking propositional dynamic logics
• Formal-Language-Constrained Path Problems
• scientific article; zbMATH DE number 1617328 (Why is no real title available?)
• scientific article; zbMATH DE number 439891 (Why is no real title available?)
• scientific article; zbMATH DE number 3679159 (Why is no real title available?)
• scientific article; zbMATH DE number 3714896 (Why is no real title available?)
• scientific article; zbMATH DE number 3478415 (Why is no real title available?)
• scientific article; zbMATH DE number 3495606 (Why is no real title available?)
• scientific article; zbMATH DE number 1254648 (Why is no real title available?)
• scientific article; zbMATH DE number 1324833 (Why is no real title available?)
• scientific article; zbMATH DE number 1462097 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic
• On notation for ordinal numbers
• On the relationship between higher-order recursion schemes and higher-order fixpoint logic
• Results on the propositional \(\mu\)-calculus
• Saturation-Based Model Checking of Higher-Order Recursion Schemes.
• Space-efficient fragments of higher-order fixpoint logic
• Strictness analysis for higher-order functions
• Temporal logics in computer science. Finite-state systems
• The Complexity of Model Checking Higher-Order Fixpoint Logic
• Tools and Algorithms for the Construction and Analysis of Systems

Cited in

(2)

• scientific article; zbMATH DE number 1537457 (Why is no real title available?)
• scientific article; zbMATH DE number 7455743 (Why is no real title available?)

Describes a project that uses

Uses Software

• TVLA

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

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