Module Spec.D

{ t_d |-> L }

t_d was transitively created with all members of L held. Additionally, no member of L could have been unlocked after the creation of t_d If L is bot, this does not represent "all mutexes". Instead, it indicates no (transitive) creation of t_d has happened

type key = TID.t
type value = Lockset.t
val add : key -> value -> t -> t
val remove : key -> t -> t
val find : key -> t -> value
val find_opt : key -> t -> value option
val mem : key -> t -> bool
val iter : (key -> value -> unit) -> t -> unit
val map : (value -> value) -> t -> t
val filter : (key -> value -> bool) -> t -> t
val mapi : (key -> value -> value) -> t -> t
val fold : (key -> value -> 'a -> 'a) -> t -> 'a -> 'a
val add_list : (key * value) list -> t -> t
val add_list_set : key list -> value -> t -> t
val add_list_fun : key list -> (key -> value) -> t -> t
val for_all : (key -> value -> bool) -> t -> bool
val reflexive_subset_domain_for_all2 : (value -> value -> bool) -> t -> t -> bool
val idempotent_inter : (value -> value -> value) -> t -> t -> t
val nonidempotent_inter : (value -> value -> value) -> t -> t -> t
val idempotent_inter_filter : (value -> value -> value option) -> t -> t -> t
val nonidempotent_inter_filter : (value -> value -> value option) -> t -> t -> t
val idempotent_union : (value -> value -> value) -> t -> t -> t
val nonidempotent_union : (value -> value -> value) -> t -> t -> t
val difference : (value -> value -> value option) -> t -> t -> t
val cardinal : t -> int
val choose : t -> key * value
val singleton : key -> value -> t
val empty : unit -> t
val is_empty : t -> bool
val exists : (key -> value -> bool) -> t -> bool
val bindings : t -> (key * value) list
val equal : t -> t -> bool
val hash : t -> int
val compare : t -> t -> int
val show : t -> string
val pretty : unit -> t -> Printable.Pretty.doc
val printXml : 'a BatInnerIO.output -> t -> unit
val name : unit -> string
val to_yojson : t -> Yojson.Safe.t
val tag : t -> int
val arbitrary : unit -> t QCheck.arbitrary
val relift : t -> t
val leq : t -> t -> bool
val join : t -> t -> t
val meet : t -> t -> t
val widen : t -> t -> t
val narrow : t -> t -> t
val pretty_diff : unit -> (t * t) -> Lattice.Pretty.doc
val bot : unit -> t
val is_bot : t -> bool
val top : unit -> t
val is_top : t -> bool
val widen_with_fct : (value -> value -> value) -> t -> t -> t
val join_with_fct : (value -> value -> value) -> t -> t -> t
val leq_with_fct : (value -> value -> bool) -> t -> t -> bool