A hoare-style proof system for robot programs

Authors:
Yongmei Liu
Affiliations:
Department of Computer Science, University of Toronto, Toronto, ON, Canada M5S 3G4
Venue:
Eighteenth national conference on Artificial intelligence
Year:
2002

Citing 3
Cited 0

Ten Years of Hoare's Logic: A Survey—Part I

ACM Transactions on Programming Languages and Systems (TOPLAS)
An axiomatic basis for computer programming

Communications of the ACM
Knowlege in action: logical foundations for specifying and implementing dynamical systems

Knowlege in action: logical foundations for specifying and implementing dynamical systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Golog is a situation calculus-based logic programming language for high-level robotic control, This paper explores Hoare's axiomatic approach to program verification in the Golog context. We present a novel Hoare-style proof system for partial correctness of Golog programs. We prove total soundness of the proof system, and relative completeness of a subsystem of it for procedureless Golog programs. Examples are given to illustrate the use of the proof system.