On higher-order reachability games vs may reachability
From MaRDI portal
Publication:6173106
DOI10.1007/978-3-031-19135-0_8arXiv2203.08416OpenAlexW4225507552MaRDI QIDQ6173106
Hiroyuki Katsura, Kazuyuki Asada, Naoki Kobayashi
Publication date: 21 July 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.08416
Related Items
Cites Work
- Unnamed Item
- SMT-based model checking for recursive programs
- The IO- and OI-hierarchies
- Automata, logics, and infinite games. A guide to current research
- A new refinement type system for automated \(\nu\text{HFL}_\mathbb{Z}\) validity checking
- Predicate abstraction and CEGAR for \(\nu \mathrm{HFL}_\mathbb{Z}\) validity checking
- Higher-order program verification via HFL model checking
- On word and frontier languages of unsafe higher-order grammars
- On Computability of Logical Approaches to Branching-Time Property Verification of Programs
- Low-level liquid types
- CONCUR 2004 - Concurrency Theory
- Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
- ICE-based refinement type discovery for higher-order functional programs
- HoIce: an ICE-based non-linear Horn clause solver
- On higher-order reachability games vs may reachability
