Verified synthesis of knowledge-based programs in finite synchronous environments
Knowledge-based programs (KBPs) are a formalism for directly relating agents' knowledge and behaviour. Here we present a general scheme for compiling KBPs to executable automata with a proof of correctness in Isabelle/HOL. We develop the algorithm top-down, using Isabelle's locale mechanism to structure these proofs, and show that two classic examples can be synthesised using Isabelle's code generator.
|Collections||ANU Research Publications|
|Source:||Mechanised Computability Theory|
|01_Gammie_Verified_synthesis_of_2011.pdf||262 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.