Ron Petrick's Webpages

Conference paper

Proof-Carrying Plans, C. Schwaab, E. Komendantskaya, A. Hill, F. Farka, R. Petrick, J. Wells, and K. Hammond, Proceedings of the International Symposium on Practical Aspects of Declarative Languages (PADL 2019), 2019.

[ bib | pdf ]


As AI applications are deployed in more and more real-world settings, it is becoming increasingly important to verify their safety and security. While declarative languages (of the kind found in automated planners and model checkers) are traditionally used for verifying AI systems, a big challenge is to design methods that generate verified executable programs. A good example of such a "verification to implementation" cycle is given by automated planning languages like PDDL, where plans are found via a model search in a declarative language, but then interpreted or compiled into executable code in an imperative language. In this paper, we show that this method can itself be verified. We present a formal framework and a prototype Agda implementation that represent PDDL plans as executable functions that inhabit types that are given by formulae describing planning problems. By exploiting the well-known Curry-Howard correspondence, type-checking then automatically ensures that the generated program corresponds precisely to the specification of the planning problem.