Saturation-Based Model Checking of Higher-Order Recursion Schemes.
From MaRDI portal
Recommendations
- Publication:4941897
- Model-checking higher-order programs with recursive types
- scientific article; zbMATH DE number 7361952
- Streett Automata Model Checking of Higher-Order Recursion Schemes
- Improving saturation-based bounded model checking
- scientific article; zbMATH DE number 2080052
- SMT-based model checking for recursive programs
- Model checking higher-order programs
- On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
Cited in
(33)- Recursion schemes and the WMSO+U logic
- Local higher-order fixpoint iteration
- Equivalence-based abstraction refinement for HORS model checking
- scientific article; zbMATH DE number 7199579 (Why is no real title available?)
- Practical alternating parity tree automata model checking of higher-order recursion schemes
- The Complexity of the Diagonal Problem for Recursion Schemes
- Model-checking higher-order programs with recursive types
- Domains for Higher-Order Games
- A practical linear time algorithm for trivial automata model checking of higher-order recursion schemes
- Cost Automata, Safe Schemes, and Downward Closures
- scientific article; zbMATH DE number 7029315 (Why is no real title available?)
- On the termination problem for probabilistic higher-order recursive programs
- Almost every simply typed -term has a long -reduction sequence
- Towards Completeness in Bounded Model Checking Through Automatic Recursion Depth Detection
- Higher-order model checking: an overview
- Parity to safety in polynomial time for pushdown and collapsible pushdown systems
- On the complexity of multi-pushdown games
- Higher-order model checking step by step
- Cost automata, safe schemes, and downward closures
- Types and higher-order recursion schemes for verification of higher-order programs
- On average-case hardness of higher-order model checking
- scientific article; zbMATH DE number 7526052 (Why is no real title available?)
- scientific article; zbMATH DE number 7455743 (Why is no real title available?)
- On the relationship between higher-order recursion schemes and higher-order fixpoint logic
- An overview of the HFL model checking project
- A traversal-based algorithm for higher-order model checking
- Relational semantics of linear logic and higher-order model checking
- Higher-order model checking in direct style
- A bounded model checking technique for higher-order programs
- A temporal logic for higher-order functional programs
- A type-based HFL model checking algorithm
- Streett Automata Model Checking of Higher-Order Recursion Schemes
- C-SHORe: a collapsible approach to higher-order verification
This page was built for publication: Saturation-Based Model Checking of Higher-Order Recursion Schemes.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958519)
