diff options
| author | Yann Herklotz <git@yannherklotz.com> | 2021-10-20 10:03:01 +0100 |
|---|---|---|
| committer | Yann Herklotz <git@yannherklotz.com> | 2021-10-20 10:03:01 +0100 |
| commit | 1d86b1c178deb97f3d499f461a417a4fe6846cf8 (patch) | |
| tree | 543b633724b5ad2657f135175efd0aaf62d2836b /src/hls/Abstr.v | |
| parent | b82b449b12650133accccd33b1d39a25ae9bb087 (diff) | |
| download | vericert-1d86b1c178deb97f3d499f461a417a4fe6846cf8.tar.gz vericert-1d86b1c178deb97f3d499f461a417a4fe6846cf8.zip | |
Start to prove termination of SAT
Diffstat (limited to 'src/hls/Abstr.v')
| -rw-r--r-- | src/hls/Abstr.v | 8 |
1 files changed, 0 insertions, 8 deletions
diff --git a/src/hls/Abstr.v b/src/hls/Abstr.v index faa5955..dc883b2 100644 --- a/src/hls/Abstr.v +++ b/src/hls/Abstr.v @@ -790,14 +790,6 @@ Definition ind_preds_l t := sat_predicate p1 c = true -> sat_predicate p2 c = false. -Definition sat_predictable : - forall a b c n, - sat_pred_simple n (a ∧ b) = Some c -> - exists d e, sat_pred_simple n a = Some e /\ sat_pred_simple n a = Some d. -Proof. - intros. unfold sat_pred_simple in H. destruct_match; try discriminate. - destruct_match. unfold sat_pred in *. simplify. - Lemma pred_equivalence_Some : forall (ta tb: PTree.t pred_op) e pe pe', ta ! e = Some pe -> |