Skip to Main content Skip to Navigation
Conference papers

A Mechanized Theory of Program Refinement

Abstract : We present a mechanized theory of program refinement that allows for the stepwise development of imperative programs in the Coq proof assistant. We formalize a design language with support for gradual refinement and a calculus which enforces correctness-by-construction. A notion of program design captures the hierarchy of refinement steps resulting from a development. The underlying theory follows the predicative programming paradigm where programs and specifications are both easily expressed as predicates, which fit naturally in the dependent type theory of the proof assistant.
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download
Contributor : Boubacar Demba Sall Connect in order to contact the contributor
Submitted on : Monday, November 18, 2019 - 9:38:30 AM
Last modification on : Sunday, June 26, 2022 - 2:43:02 AM


Files produced by the author(s)



Boubacar Demba Sall, Frédéric Peschanski, Emmanuel Chailloux. A Mechanized Theory of Program Refinement. ICFEM 2019 - 21st International Conference on Formal Engineering Methods, Nov 2019, Shenzhen, China. pp.305-321, ⟨10.1007/978-3-030-32409-4_19⟩. ⟨hal-02367566⟩



Record views


Files downloads