proposition: Lemma dag_local_facts: forall sh x (g: Graph), weak_valid g x -> dag sh x g |-- valid_pointer (pointer_val_val x).
proof: Proof. intros. destruct H. - simpl in H. subst x. entailer!. - destruct (vgamma g x) as [[d l] r] eqn:?. pose proof (@root_unfold _ (sSGG_VST sh) g x d l r H Heqp); clear -H0. simpl in *. rewrite H0. entailer!. Qed.
imports: CertiGraph.lib.Coqlib VST.floyd.proofauto CertiGraph.mark.env_mark_bin CertiGraph.graph.graph_model CertiGraph.graph.weak_mark_lemmas CertiGraph.graph.path_lemmas CertiGraph.graph.subgraph2 CertiGraph.graph.reachable_computable CertiGraph.msl_application.Graph CertiGraph.msl_application.GraphBin CertiGraph.msl_application.Graph_Mark CertiGraph.msl_application.DagBin_Mark CertiGraph.floyd_ext.share CertiGraph.mark.spatial_graph_bin_mark VST.msl.wand_frame VST.floyd.reassoc_seq VST.floyd.field_at_wand