MetadataShow full item record
It is becoming increasingly important to verify safety and security of AI applications. 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.
Schwaab , C J , Komendantskaya , E , Hill , A , Farka , F , Petrick , R , Wells , J & Hammond , K 2019 , Proof-carrying plans . in J J Alferes & M Johansson (eds) , Practical Aspects of Declarative Languages : 21st International Symposium, PADL 2019, Lisbon, Portugal, January 14-15, 2019, Proceedings . Lecture Notes in Computer Science (Programming and Software Engineering) , vol. 11372 , Springer , Cham , pp. 204-220 , 21st International Symposium on Practical Aspects of Declarative Languages (PADL 2019) , Lisbon , Portugal , 14/01/19 . https://doi.org/10.1007/978-3-030-05998-9_13conference
Practical Aspects of Declarative Languages
© 2019, Springer Nature Switzerland AG. This work has been made available online in accordance with the publisher's policies. This is the author created accepted version manuscript following peer review and as such may differ slightly from the final published version. The final published version of this work is available at https://doi.org/10.1007/978-3-030-05998-9_13
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.