Séverine Maingaud

  • Citations Per Year
Learn More
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(More)
We propose a semantic model of PAF!, a proof assistant dedicated to program verification focused on the functional fragment of ML. In particular, we model the strong typing predicate, specific to the PAF! system. From the semantic correctness of the system, we prove the consistency of the formalism, as well as the termination property for all strongly typed(More)
  • 1