Module Wp.CfgCompiler.Cfg.P

module P: sig .. end
Relocatable predicate

type t 
val pretty : Format.formatter -> t -> unit
val create : S.t Wp.CfgCompiler.Cfg.Node.Map.t -> Wp.Lang.F.pred -> t
Bundle an equation with the sigma sequence that created it. | create m p | = | p |
val get : t -> Wp.Lang.F.pred
val reads : t -> S.domain Wp.CfgCompiler.Cfg.Node.Map.t
val nodes : t -> Wp.CfgCompiler.Cfg.Node.Set.t
val relocate : S.t Wp.CfgCompiler.Cfg.Node.Map.t ->
t -> t
| relocate m' (create m p) | = | p{ } |
val to_condition : t ->
(Wp.CfgCompiler.Cfg.C.t * Wp.CfgCompiler.Cfg.Node.t option) option