Weakest precondition for general recursive programs formalized in coq
(2002)
Presentation / Conference Contribution
Zhang, X., Munro, M., Harman, M., & Hu, L. (2002, January). Weakest precondition for general recursive programs formalized in coq. Presented at 15th International Conference on Theorem Proving in Higher Order Logics : TPHOLs., Hampton, VA
This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is a deep embedding using the computational power intrinsic to type theory. Since C... Read More about Weakest precondition for general recursive programs formalized in coq.