Automated techniques for higher-order program verification
Progress in Informatics
Organizers: Naoki KOBAYASHI (The University of Tokyo) Luke ONG (University of Oxford) David Van HORN (Northeastern University) With the increasing importance of software reliability, program verification has been an important and hot research topic. Recently, we have seen some good progress in automated techniques for verification of higher-order programs. Studies of game semantics have yielded compositional model checkers and automated program equivalence checkers for Algol-like programming
... guages, and studies of higher-order recursion schemes and pushdown automata have yielded model checkers for higher-order functional programs. Classical control flow analysis has been recently revisited to yield more precise and/or efficient methods than Shivers' k-CFA. The aim of the workshop was to bring together researchers on automated techniques for higherorder program verification and analyses, and provide them with an opportunity to exchange new research results, and discuss further extensions. The workshop also aimed for cross-fertilization of different techniques for higher-order program verification, such as game semantics, type theories, higher-order grammars and pushdown systems, control flow analyses, and abstract interpretation. The workshop was organized on an invitation basis, and 25 researchers (including 3 organizers) attended it. The workshop program consisted of tutorials, technical talks, and discussions. We collect abstracts of the talks below.