proposition: Lemma Graph_reachable_by_dec: forall (G: Graph) x (P: NodePred addr), Decidable (vvalid G x) -> ReachDecidable G x P.
proof: Proof. intros. intro y. apply reachable_by_decidable with (is_null := is_null_SGBA); auto. + apply maGraph. + apply LocalFiniteGraph_FiniteGraph, finGraph. + apply FiniteGraph_EnumCovered, finGraph. Qed.
imports: CertiGraph.lib.Ensembles_ext Coq.Lists.List VST.msl.seplog VST.msl.log_normalize CertiGraph.lib.Coqlib CertiGraph.lib.EquivDec_ext CertiGraph.msl_ext.log_normalize CertiGraph.msl_ext.iter_sepcon CertiGraph.msl_ext.seplog CertiGraph.graph.graph_model CertiGraph.graph.path_lemmas CertiGraph.graph.reachable_computable CertiGraph.graph.reachable_ind CertiGraph.graph.subgraph2 CertiGraph.graph.graph_gen CertiGraph.graph.BinGraph CertiGraph.graph.MathGraph CertiGraph.graph.FiniteGraph CertiGraph.msl_application.Graph Coq.Logic.Classical