Automated Verification of Higher-Order Functional Programs

Abstract

AbstractRecently, motivated by the success of software model checkers for automated first-order program verification, researchers have proposed “model checkers” for automated verification of higher-order functional programs. Following the first-order methods, the higher-order verifiers employ a framework that separates control from data, allowing a smooth migration of tools and techniques such as predicate abstraction, CEGAR, SMT solving, and interpolation that have proven effective in first-order program verification. In this talk, we report on the state of the art in this emerging area of research, and discuss some future issues. In particular, we show that, in contrast to the automated methods for first-order programs, the current approaches lack relative completeness, and we present our ongoing research toward that end.KeywordsArtificial IntelligenceMathematical LogicModel CheckerSoftware EngineerCurrent ApproachThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.