On Higher-Order Reachability Games vs May Reachability

Kazuyuki Asada, Hiroyuki Katsura, Naoki Kobayashi

We consider the reachability problem for higher-order functional programs and study the relationship between reachability games (i.e., the reachability problem for programs with an…