作者: Peter Gammie
DOI: 10.1007/978-3-642-22863-6_9
关键词: Correctness 、 Theoretical computer science 、 Programming language 、 HOL 、 Knowledge-based systems 、 Code generation 、 Mathematical proof 、 Automated theorem proving 、 Automata theory 、 Executable 、 Computer science
摘要: Knowledge-based programs (KBPs) are a formalism for directly relating agents' knowledge and behaviour. Here we present general scheme compiling KBPs to executable automata with proof of correctness in Isabelle/HOL. We develop the algorithm top-down, using Isabelle's locale mechanism structure these proofs, show that two classic examples can be synthesised code generator.