Streett Automata Model Checking of Higher-Order Recursion Schemes
From MaRDI portal
Publication:5111330
DOI10.4230/LIPIcs.FSCD.2017.32zbMath1441.68135OpenAlexW3170373610MaRDI QIDQ5111330
Takeshi Tsukada, Koichi Fujima, Naoki Kobayashi, Ryota Suzuki
Publication date: 26 May 2020
Full work available at URL: https://cir.nii.ac.jp/ja/crid/1010282202008768001
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (2)
Streett Automata Model Checking of Higher-Order Recursion Schemes ⋮ Exact bounds for acyclic higher-order recursion schemes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Predicate abstraction and CEGAR for disproving termination of higher-order functional programs
- Tractable constraints in finite semilattices
- Automata, logics, and infinite games. A guide to current research
- Verification of concurrent programs: The automata-theoretic framework
- A ZDD-Based Efficient Higher-Order Model Checking Algorithm
- Temporal verification of higher-order functional programs
- Practical Alternating Parity Tree Automata Model Checking of Higher-Order Recursion Schemes
- Finitary Semantics of Linear Logic and Higher-Order Model-Checking
- Saturation-Based Model Checking of Higher-Order Recursion Schemes.
- Automatically disproving fair termination of higher-order functional programs
- A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes
- Proving that programs eventually do something good
- Propositional dynamic logic of looping and converse is elementarily decidable
- Compositional higher-order model checking via ω -regular games over Böhm trees
- Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata
- Streett Automata Model Checking of Higher-Order Recursion Schemes
- A traversal-based algorithm for higher-order model checking
- Higher-order multi-parameter tree transducers and recursion schemes for program verification
- Types and higher-order recursion schemes for verification of higher-order programs
- On the complexity of set-based analysis
- Relational semantics of linear logic and higher-order model-checking
- Model Checking Higher-Order Programs
- A type-directed abstraction refinement approach to higher-order model checking
- Verifying higher-order functional programs with pattern-matching algebraic data types
- Typed Lambda Calculi and Applications
This page was built for publication: Streett Automata Model Checking of Higher-Order Recursion Schemes
