Class BoundedSetDomain<T, Value>

constructor

• new BoundedSetDomain<T, Value extends BoundedSetLift<T> = BoundedSetLift<T>>(
      value: Value | T[],
      limit?: number,
      setType?: typeof Set,
  ): BoundedSetDomain<T, Value>

  Type Parameters

  • T

    Type of the values in the abstract domain

  • Value extends BoundedSetLift<T> = BoundedSetLift<T>

    Type of the constraint in the abstract domain (Top, Bottom, or an actual value)

  Parameters

  • value: Value | T[]
  • limit: number = DEFAULT_INFERENCE_LIMIT

    A limit for the maximum number of elements to store in the set

  • setType: typeof Set = Set

    An optional set constructor for the domain elements if the type T is not storable in a HashSet

  Returns BoundedSetDomain<T, Value>

Readonlylimit

Staticabstract

• abstract<T>(
      concrete: typeof Top | ReadonlySet<T>,
      limit?: number,
      setType?: typeof Set,
  ): BoundedSetDomain<T>

  Type Parameters

  • T

  Parameters

  • concrete: typeof Top | ReadonlySet<T>
  • Optionallimit: number
  • OptionalsetType: typeof Set

  Returns BoundedSetDomain<T>

Staticbottom

• bottom<T>(
      limit?: number,
      setType?: typeof Set,
  ): BoundedSetDomain<T, ReadonlySet<never>>

  Type Parameters

  • T

  Parameters

  • Optionallimit: number
  • OptionalsetType: typeof Set

  Returns BoundedSetDomain<T, ReadonlySet<never>>

Statictop

• top<T>(limit?: number, setType?: typeof Set): BoundedSetDomain<T, typeof Top>

  Type Parameters

  • T

  Parameters

  • Optionallimit: number
  • OptionalsetType: typeof Set

  Returns BoundedSetDomain<T, typeof Top>

abstract

• abstract(concrete: typeof Top | ReadonlySet<T>): this

  Maps a set of possible concrete values into an abstract value as abstraction function of the abstract domain (should additionally be provided as static function).

  Parameters

  • concrete: typeof Top | ReadonlySet<T>

  Returns this

bottom

• bottom(): BoundedSetDomain<T, Value> & BoundedSetDomain<T, ReadonlySet<never>>

  Gets the Bottom element (least element) of the complete lattice (should additionally be provided as static function).

  Returns BoundedSetDomain<T, Value> & BoundedSetDomain<T, ReadonlySet<never>>

concretize

• concretize(limit: number): typeof Top | ReadonlySet<T>

  Maps the current abstract value into a set of possible concrete values as concretization function of the abstract domain. The result should be Top if the number of concrete values would reach the limit or the resulting set would have infinite many elements.

  Parameters

  • limit: number

  Returns typeof Top | ReadonlySet<T>

create

• create(value: BoundedSetLift<T> | T[]): this

  Creates an abstract value of the lattice for a given value.

  Parameters

  • value: BoundedSetLift<T> | T[]

  Returns this

equals

• equals(other: this): boolean

  Checks whether the current abstract value equals to another abstract value.

  Parameters

  • other: this

  Returns boolean

isBottom

• isBottom(): this is BoundedSetDomain<T, ReadonlySet<never>>

  Checks whether the current abstract value is the Bottom element of the complete lattice.

  Returns this is BoundedSetDomain<T, ReadonlySet<never>>

isTop

• isTop(): this is BoundedSetDomain<T, typeof Top>

  Checks whether the current abstract value is the Top element of the complete lattice.

  Returns this is BoundedSetDomain<T, typeof Top>

isValue

• isValue(): this is BoundedSetDomain<T, BoundedSetValue<T>>

  Checks whether the current abstract value is an actual value of the complete lattice (this may include the Top or Bottom element if they are also values and no separate symbols, for example).

  Returns this is BoundedSetDomain<T, BoundedSetValue<T>>

join

• join(other: BoundedSetLift<T> | T[]): this

  Joins the current abstract value with another abstract value by creating the least upper bound (LUB) in the lattice.

  Parameters

  • other: BoundedSetLift<T> | T[]

  Returns this

• join(other: this): this

  Parameters

  • other: this

  Returns this

leq

• leq(other: this): boolean

  Checks whether the current abstract value is less than or equal to another abstract value with respect to the partial order of the lattice.

  Parameters

  • other: this

  Returns boolean

meet

• meet(other: BoundedSetLift<T> | T[]): this

  Meets the current abstract value with another abstract value by creating the greatest lower bound (GLB) in the lattice.

  Parameters

  • other: BoundedSetLift<T> | T[]

  Returns this

• meet(other: this): this

  Parameters

  • other: this

  Returns this

narrow

• narrow(other: this): this

  Narrows the current abstract value with another abstract value as a sound over-approximation of the meet (greatest lower bound) to refine the value after widening.

  Parameters

  • other: this

  Returns this

satisfies

• satisfies(value: T): Ternary

  Checks whether the current abstract value satisfies a concrete value (i.e. includes a concrete value).

  Parameters

  • value: T

  Returns Ternary

  See

  Ternary for the returned satisfiability result

subtract

• subtract(other: BoundedSetLift<T> | BoundedSetDomain<T, Value> | T[]): this

  Subtracts another abstract value from the current abstract value by removing all elements of the other abstract value from the current abstract value.

  Parameters

  • other: BoundedSetLift<T> | BoundedSetDomain<T, Value> | T[]

  Returns this

toJson

• toJson(): unknown

  Converts the lattice into a JSON serializable value.

  Returns unknown

top

• top(): BoundedSetDomain<T, Value> & BoundedSetDomain<T, typeof Top>

  Gets the Top element (greatest element) of the complete lattice (should additionally be provided as static function).

  Returns BoundedSetDomain<T, Value> & BoundedSetDomain<T, typeof Top>

toString

• toString(): string

  Converts the lattice into a human-readable string.

  Returns string

widen

• widen(other: this): this

  Widens the current abstract value with another abstract value as a sound over-approximation of the join (least upper bound) for fixpoint iteration acceleration.

  Parameters

  • other: this

  Returns this