Specifying Imperative ML-like Programs Using Dynamic Logic ⋆
BibTeX
@MISC{Maingaud_specifyingimperative,
author = {Séverine Maingaud and Vincent Balat and Richard Bubel and Reiner Hähnle and Re Miquel and Université Paris and Diderot Paris and Ens Lyon and Université De Lyon and Key Af},
title = {Specifying Imperative ML-like Programs Using Dynamic Logic ⋆},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We present a logical system suited for specification and verification of imperative ML programs. The specification language combines dynamic logic (DL), explicit state updates and second-order functional arithmetic. Its proof system is based on a Gentzen-style sequent calculus (adapted to modal logic) with facilities for symbolic evaluation. We illustrate the system with some example, and give a full Kripke-style semantics in order to prove its correctness.
Citations
| 1219 | An axiomatic basis for computer programming - Hoare - 1969 |
| 48 | Formal system development with KIV - Balser, Reif, et al. - 2000 |
| 36 | Why: a multi-language multi-prover verification tool - Filliâtre - 2003 |
| 35 | Dynamic Logic. Foundations of Computing - Harel, Kozen, et al. - 2000 |
| 28 | types and models - Krivine, Lambda-calculus - 1993 |
| 21 | Effective interactive proofs for higher-order imperative programs - Chlipala, Malecha, et al. - 2009 |
| 14 | parallel, and quantified updates of first-order structures - Sequential - 2006 |
| 11 | A Hoare logic for call-by-value functional programs - RÉGIS-GIANAS, POTTIER - 2008 |
| 3 | Who: A Verifier for Effectful Higher-order Programs - KANIG, FILLIÂTRE - 2009 |
| 1 | Introduction to PAF!, a proof assistant for ml programs verification - Baro - 2003 |
