scientific article; zbMATH DE number 7455743
From MaRDI portal
Publication:5021005
Recommendations
- Local higher-order fixpoint iteration
- Fixed Point Iteration for Local Strictly Pseudo-Contractive Mapping
- scientific article; zbMATH DE number 1971602
- Iterative approximation of fixed points
- Local convergence of a certain class of iterative methods and applications
- Iterative methods for fixed point approximation
- scientific article; zbMATH DE number 4062141
- scientific article; zbMATH DE number 32212
- Implicit fixed point iterations
- Efficient optimal families of higher-order iterative methods with local convergence
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
(4)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5021005)