Higher-order model checking step by step
From MaRDI portal
Cites work
- A model for behavioural properties of higher-order programs
- A practical linear time algorithm for trivial automata model checking of higher-order recursion schemes
- A traversal-based algorithm for higher-order model checking
- A type-directed abstraction refinement approach to higher-order model checking
- Collapsible pushdown automata and labeled recursion schemes, equivalence, safety and effective selection
- Collapsible pushdown automata and recursion schemes
- Compositional higher-order model checking via -regular games over Böhm trees
- Deciding parity games in quasipolynomial time
- scientific article; zbMATH DE number 2087432 (Why is no real title available?)
- Indexed Grammars—An Extension of Context-Free Grammars
- Krivine machines and higher-order schemes
- Model checking higher-order programs
- MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS
- On Global Model Checking Trees Generated by Higher-Order Recursion Schemes
- Ordered tree-pushdown systems
- Practical alternating parity tree automata model checking of higher-order recursion schemes
- Saturation-Based Model Checking of Higher-Order Recursion Schemes.
- Simply typed fixpoint calculus and collapsible pushdown automata
- Size-preserving translations from order-(n+1) word grammars to order-n tree grammars
- Streett Automata Model Checking of Higher-Order Recursion Schemes
- The diagonal problem for higher-order recursion schemes is decidable
This page was built for publication: Higher-order model checking step by step
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241240)
