3 citations · 3 across the 1 of their papers we have counts for
1 paper
Naoki Kobayashi
The decidability of the reachability problem for finitary PCF has been used as a theoretical basis for fully automated verification tools for functional programs. The reachability…