Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

merge VST into OpenMP #786

Closed
wants to merge 4 commits into from
Closed
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Binary file modified concurrency/.DS_Store
Binary file not shown.
112 changes: 0 additions & 112 deletions concurrency/cancelable_invariants.v

This file was deleted.

Binary file removed concurrency/common/.DS_Store
Binary file not shown.
15 changes: 6 additions & 9 deletions concurrency/common/threadPool.v
Original file line number Diff line number Diff line change
Expand Up @@ -1238,23 +1238,20 @@ Module OrdinalPool.
Lemma eq_op_false: forall A i j, i <>j -> @eq_op A i j = false.
Proof.
intros.
unfold eq_op; simpl.
(*
unfold Equality.op. destruct A eqn:?. simpl.
unfold Equality.sort in *.
destruct m; simpl in *.
generalize (a i j); intros. inv H0; auto. contradiction H;auto.
apply (@negbRL _ true).
eapply contraFneq; last done.
intros. easy.
Qed.
*) Admitted.


Lemma gsoThreadCode:
forall {i j tp} (Hneq: i <> j) (cnti: containsThread tp i)
(cntj: containsThread tp j) c' p'
(cntj': containsThread (updThread cnti c' p') j),
getThreadC cntj' = getThreadC cntj.
Proof.
intros.
simpl.
simpl. Search eq_op.
Check contraFneq.
unfold eq_op. simpl.
rewrite eq_op_false; auto.
unfold updThread in cntj'. unfold containsThread in *. simpl in *.
Expand Down
Binary file removed concurrency/compiler/.DS_Store
Binary file not shown.
14 changes: 11 additions & 3 deletions concurrency/compiler/mem_equiv.v
Original file line number Diff line number Diff line change
Expand Up @@ -5,6 +5,7 @@ Require Import Relation_Definitions.

Require Import compcert.common.Values.
Require Import compcert.common.Memory.
Require Import compcert.lib.Maps.

Require Import VST.concurrency.lib.setoid_help.
Require Import VST.concurrency.common.permissions. Import permissions.
Expand Down Expand Up @@ -33,7 +34,7 @@ Lemma part_reflexive_proper_proxy {A P} {R: relation A}
`(PartReflexive A P R) (x : A) : P x -> ProperProxy R x.
intros. eapply H; auto.
Qed.
(* This ensures that when ProperProxy is ebing resolved,
(* This ensures that when ProperProxy is being resolved,
partial reflexivity is considered
*)
#[export] Hint Extern 3 (ProperProxy ?R _) =>
Expand Down Expand Up @@ -78,7 +79,6 @@ Qed.




Ltac rewrite_getPerm_goal:=
match goal with
| [|- context[(?f ?m) !! ?b ?ofs ?k] ] =>
Expand Down Expand Up @@ -112,6 +112,14 @@ Proof.
- unfold access_map_equiv in *; etransitivity; auto.
Qed.

Global Instance permMapLt_order : PartialOrder access_map_equiv permMapLt.
Proof.
split.
- intros H; split; intros ??; rewrite H; apply po_refl.
- intros [H1 H2] ?.
extensionality o.
apply perm_order_antisym; auto.
Qed.

Ltac destruct_address_range b ofs b0 ofs0 n:=
let Hrange:= fresh "Hrange" in
Expand Down Expand Up @@ -367,7 +375,7 @@ Proof.
unfold permission_at in Hlt.
unfold PMap.get in Hlt.
rewrite HH in Hlt.
rewrite Clight_bounds.Mem_canonical_useful in Hlt.
rewrite Mem_canonical_useful in Hlt.
simpl in Hlt.
destruct ( (snd perm) ! b).
+ destruct (o ofs); first [contradiction | auto].
Expand Down
Loading
Loading