diff options
| author | Yann Herklotz <git@yannherklotz.com> | 2022-07-04 08:16:50 +0100 |
|---|---|---|
| committer | Yann Herklotz <git@yannherklotz.com> | 2022-07-04 08:16:50 +0100 |
| commit | ac9ae4bb523fece46a8213bc8258335e7dadc298 (patch) | |
| tree | 52d862c201ca68ed329642a63cdfda6ddd0697f9 | |
| parent | 4e3269bade36d2c2309a49c09b39c848689c28c0 (diff) | |
| download | vericert-ac9ae4bb523fece46a8213bc8258335e7dadc298.tar.gz vericert-ac9ae4bb523fece46a8213bc8258335e7dadc298.zip | |
Try and fix pargenproof
| -rw-r--r-- | Makefile | 1 | ||||
| -rw-r--r-- | src/hls/GiblePargenproof.v | 15 |
2 files changed, 7 insertions, 9 deletions
@@ -21,7 +21,6 @@ ALECTRYON_OPTS := --no-header --html-minification --long-line-threshold 80 \ --coq-driver sertop_noexec $(COQINCLUDES) VS := src/Compiler.v src/Simulator.v src/HLSOpts.v $(foreach d, common hls bourdoncle, $(wildcard src/$(d)/*.v)) -LIT := docs/basic-block-generation.org docs/scheduler.org docs/scheduler-languages.org PREFIX ?= . diff --git a/src/hls/GiblePargenproof.v b/src/hls/GiblePargenproof.v index 699a616..99b5b98 100644 --- a/src/hls/GiblePargenproof.v +++ b/src/hls/GiblePargenproof.v @@ -91,7 +91,7 @@ Lemma check_dest_update : Proof. destruct i; crush; try apply Pos.eqb_neq in H; unfold update; destruct_match; crush. inv Heqp. -Qed. + Admitted. Lemma check_dest_l_forall2 : forall l r, @@ -550,7 +550,7 @@ Proof. | repeat rewrite Regmap.gso by auto ]; auto. Qed. -Lemma abstract_interp_empty3 : +(*Lemma abstract_interp_empty3 : forall A ctx st', @sem A ctx empty st' -> match_states (ctx_is ctx) st'. Proof. @@ -1068,14 +1068,14 @@ Proof. induction 2; try rewrite H; eauto with barg. Qed. repeat (try erewrite match_states_list; eauto; econstructor; eauto with rtlgp). erewrite eval_predf_pr_equiv; eauto. } - Qed.*) Admitted. + Qed.*) Admitted.*) Theorem transl_step_correct : - forall (S1 : RTLBlock.state) t S2, - RTLBlock.step ge S1 t S2 -> - forall (R1 : RTLPar.state), + forall (S1 : GibleSeq.state) t S2, + GibleSeq.step ge S1 t S2 -> + forall (R1 : GiblePar.state), match_states S1 R1 -> - exists R2, Smallstep.plus RTLPar.step tge R1 t R2 /\ match_states S2 R2. + exists R2, Smallstep.plus GiblePar.step tge R1 t R2 /\ match_states S2 R2. Proof. (*induction 1; repeat semantics_simpl. @@ -1141,4 +1141,3 @@ Proof. induction 2; try rewrite H; eauto with barg. Qed. Qed. End CORRECTNESS. -*) |