Specifying Imperative ML-like Programs Using Dynamic Logic
Paper i 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

KeY

AF2

program specification

program verification

ML

Författare

Severine Maingaud

Université Paris Diderot

Vincent Balat

Université Paris Diderot

Richard Bubel

Chalmers, Data- och informationsteknik, Programvaruteknik

Reiner Hähnle

Chalmers, Data- och informationsteknik, Programvaruteknik

Alexandre Miquel

Université de Lyon

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. 6528 122-137

Styrkeområden

Informations- och kommunikationsteknik

Ämneskategorier

Programvaruteknik

Datavetenskap (datalogi)

DOI

10.1007/978-3-642-18070-5_9

ISBN

978-3-642-18069-9

Mer information

Senast uppdaterat

2018-08-01