Nicola Botta

Semantic verification of dynamic programming.

2020 · arXiv (Cornell University)

We prove that the generic framework for specifying and solving finite-horizon, monadic sequential decision problems proposed in (Botta et al.,2017) is semantically correct. By semantically correct we mean that, for a problem specification $P$ and …