Research Article

Proving Reliability of Image Processing Techniques in Digital Forensics Applications

Listing 1

Interactive formal proof in Coq.
Inductive nat: Type:=
 |O: nat
 |S: nat ⟶ nat.
Fixpoint add (n m: nat): nat:=
 match n with
 |O ⇒ m
 |S nʹ ⇒ S (add nʹ m)
 end.
Lemma add_n_o: ∀ n, add n O = n.
Proof.
 induction n.
+ (CASE 1: n is O)
reflexivity.
 + (CASE 2: n is (S n))
 simpl. rewrite IHn. auto.
Qed.