Module `Concurrency__StarvationDomain.VarDomain`

include Absint.AbstractDomain.WithTop

include Absint.AbstractDomain.S

include Absint.AbstractDomain.NoJoin

include IStdlib.PrettyPrintable.PrintableType

type t

val pp : IStdlib.PrettyPrintable.F.formatter -> t -> unit

val leq : lhs:t -> rhs:t -> bool: the implication relation: lhs <= rhs means lhs |- rhs

val join : t -> t -> t
val widen : prev:t -> next:t -> num_iters:int -> t

val top : t
val is_top : t -> bool

type key = IR.Var.t

val get : key -> t -> Absint.HilExp.AccessExpression.t option
val set : key -> Absint.HilExp.AccessExpression.t -> t -> t