Specifying Imperative ML-like Programs Using Dynamic Logic
Paper in proceeding, 2011

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.

dynamic logic



program specification

program verification



Severine Maingaud

Paris Diderot University

Vincent Balat

Paris Diderot University

Richard Bubel

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Reiner Hähnle

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Alexandre Miquel

Université de Lyon

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 6528 122-137
978-3-642-18069-9 (ISBN)

Areas of Advance

Information and Communication Technology

Subject Categories

Software Engineering

Computer Science





More information

Latest update

8/1/2018 9