Specifying imperative ML-like programs using dynamic logic

Authors:
Séverine Maingaud;Vincent Balat;Richard Bubel;Reiner Hähnle;Alexandre Miquel
Affiliations:
Laboratoire Preuves, Programmes et Systèmes, CNRS and Université Paris Diderot, Paris 7;Laboratoire Preuves, Programmes et Systèmes, CNRS and Université Paris Diderot, Paris 7;Department of Computer Science and Engineering, Chalmers University, Gothenburg;Department of Computer Science and Engineering, Chalmers University, Gothenburg;ENS Lyon, Université de Lyon, LIP, CNRS ENS Lyon, UCBL, INRIA
Venue:
FoVeOOS'10 Proceedings of the 2010 international conference on Formal verification of object-oriented software
Year:
2010

Citing 9
Cited 0

Lambda-calculus, types and models

Lambda-calculus, types and models
An axiomatic basis for computer programming

Communications of the ACM
Dynamic Logic

Dynamic Logic
Formal System Development with KIV

FASE '00 Proceedings of the Third Internationsl Conference on Fundamental Approaches to Software Engineering: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
A Hoare Logic for Call-by-Value Functional Programs

MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
Effective interactive proofs for higher-order imperative programs

Proceedings of the 14th ACM SIGPLAN international conference on Functional programming
Who: a verifier for effectful higher-order programs

Proceedings of the 2009 ACM SIGPLAN workshop on ML
Verification of object-oriented software: The KeY approach

Verification of object-oriented software: The KeY approach
Sequential, parallel, and quantified updates of first-order structures

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning

Quantified Score

Hi-index	0.00

Visualization

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.