blob: 465e02bc23e5a07dc087d13d9605209f4b686e33 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
|
(***********************************************************************)
(* v * The Coq Proof Assistant / The Coq Development Team *)
(* <O___,, * INRIA-Rocquencourt & LRI-CNRS-Orsay *)
(* \VV/ *************************************************************)
(* // * This file is distributed under the terms of the *)
(* * GNU Lesser General Public License Version 2.1 *)
(***********************************************************************)
(* Certification of Imperative Programs / Jean-Christophe Filliâtre *)
(* $Id$ *)
(* The main tactic: takes a name N, a program P, creates a goal
* of name N with the functional specification of P, then apply the Refine
* tactic with the partial proof term obtained by the translation of
* P into a functional program.
*
* Then an ad-hoc automatic tactic is applied on each subgoal to solve the
* trivial proof obligations *)
val correctness : string -> Past.program -> Tacmach.tactic option -> unit
|
