Streett Automata Model Checking of Higher-Order Recursion Schemes
From MaRDI portal
Recommendations
- Practical alternating parity tree automata model checking of higher-order recursion schemes
- Saturation-Based Model Checking of Higher-Order Recursion Schemes.
- A traversal-based algorithm for higher-order model checking
- A practical linear time algorithm for trivial automata model checking of higher-order recursion schemes
- Model-checking higher-order programs with recursive types
Cites work
- 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
- A ZDD-Based Efficient Higher-Order Model Checking Algorithm
- Automata, logics, and infinite games. A guide to current research
- Automatically disproving fair termination of higher-order functional programs
- Compositional higher-order model checking via -regular games over Böhm trees
- Finitary semantics of linear logic and higher-order model-checking
- Higher-order multi-parameter tree transducers and recursion schemes for program verification
- scientific article; zbMATH DE number 1722657 (Why is no real title available?)
- scientific article; zbMATH DE number 2087432 (Why is no real title available?)
- Model checking higher-order programs
- On the complexity of set-based analysis
- Practical alternating parity tree automata model checking of higher-order recursion schemes
- Predicate abstraction and CEGAR for disproving termination of higher-order functional programs
- Propositional dynamic logic of looping and converse is elementarily decidable
- Proving that programs eventually do something good
- Recursive schemes, Krivine machines, and collapsible pushdown automata
- Relational semantics of linear logic and higher-order model checking
- Saturation-Based Model Checking of Higher-Order Recursion Schemes.
- Streett Automata Model Checking of Higher-Order Recursion Schemes
- Temporal verification of higher-order functional programs
- Tractable constraints in finite semilattices
- Typed Lambda Calculi and Applications
- Types and higher-order recursion schemes for verification of higher-order programs
- Verification of concurrent programs: The automata-theoretic framework
- Verifying higher-order functional programs with pattern-matching algebraic data types
Cited in
(9)- Generalizations of checking stack automata: characterizations and hierarchies
- Exact bounds for acyclic higher-order recursion schemes
- Practical alternating parity tree automata model checking of higher-order recursion schemes
- Saturation-Based Model Checking of Higher-Order Recursion Schemes.
- scientific article; zbMATH DE number 5825969 (Why is no real title available?)
- Streett Automata Model Checking of Higher-Order Recursion Schemes
- A type-based HFL model checking algorithm
- On average-case hardness of higher-order model checking
- Higher-order model checking step by step
This page was built for publication: Streett Automata 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 Q5111330)
