Verified synthesis of knowledge-based programs in finite synchronous environments
Abstract
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.
Description
Citation
Collections
Source
Mechanised Computability Theory
Type
Book Title
Entity type
Access Statement
License Rights
Restricted until
2037-12-31
Downloads
File
Description