Programming and reasoning with partial observability
Eric Atkinson, Michael Carbin
摘要
Computer programs are increasingly being deployed in partially-observable environments. A partially observable environment is an environment whose state is not completely visible to the program, but from which the program receives partial observations. Developers typically deal with partial observability by writing a state estimator that, given observations, attempts to deduce the hidden state of the environment. In safety-critical domains, to formally verify safety properties developers may write an environment model. The model captures the relationship between observations and hidden states and is used to prove the software correct. In this paper, we present a new methodology for writing and verifying programs in partially observable environments. We present belief programming , a programming methodology where developers write an environment model that the program runtime automatically uses to perform state estimation. A belief program dynamically updates and queries a belief state that captures the possible states the environment could be in. To enable verification, we present Epistemic Hoare Logic that reasons about the possible belief states of a belief program the same way that classical Hoare logic reasons about the possible states of a program. We develop these concepts by defining a semantics and a program logic for a simple core language called BLIMP. In a case study, we show how belief programming could be used to write and verify a controller for the Mars Polar Lander in BLIMP. We present an implementation of BLIMP called CBLIMP and evaluate it to determine the feasibility of belief programming.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper1
相关 Paper
- Program Semantics and Verification Technique for AI-Centred ProgramsSolofomampionona Fortunat Rajaona, Ioana Boureanu, Vadim Malvone, Francesco BelardinelliFM 2023 · 被引用 1 次
- Inference and Learning with Model Uncertainty in Probabilistic Logic ProgramsVictor Verreet, Vincent Derkinderen, Pedro Zuidberg Dos Martires, Luc De RaedtAAAI 2022 · 被引用 4 次
- Automatically Verifying Expressive Epistemic Properties of ProgramsFrancesco Belardinelli, Ioana Boureanu, Vadim Malvone, Fortunat RajaonaAAAI 2023 · 被引用 1 次
- Point-Based Methods for Model Checking in Partially Observable Markov Decision ProcessesMaxime Bouton, Jana Tumova, Mykel J. KochenderferAAAI 2020 · 被引用 32 次
- Structural Temporal Logic for Mechanized Program VerificationEleftherios Ioannidis, Yannick Zakowski, Steve Zdancewic, Sebastian AngelOOPSLA 2025 · 被引用 1 次
