Skip to main content
Conference Proceedings

Verified synthesis of knowledge-based programs in finite synchronous environments

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6898 LNCS 87-102
DOI: 10.1007/978-3-642-22863-6_9
1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Gammie, P. (2011). Verified synthesis of knowledge-based programs in finite synchronous environments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6898 LNCS, pp. 87–102). https://doi.org/10.1007/978-3-642-22863-6_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free