Value Members

1.  final def !=(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

2.  final def ##(): Int

   Definition Classes

   AnyRef → Any

3.  final def ==(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

4.  final def asEPS: EPS[E, P]

   This EOptionP as an EPS object; defined iff at least a preliminary property exists.

   This EOptionP as an EPS object; defined iff at least a preliminary property exists.

   Definition Classes

   EPS → EOptionP

5.  def asFinal: FinalEP[E, P]

   Definition Classes

   IntermediateESimpleP → EOptionP

6.  final def asInstanceOf[T0]: T0

   Definition Classes

   Any

7.  def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @native() @throws( ... )

8.  val e: E

   The entity.

   The entity. E.g., a class, method or field. In general, it is recommended to use entities that stand for specific elements in the code, but which are not the concrete source code entities themselves. This greatly facilitates associating properties with entities where the respective code is not available. For example, by using an object which acts as a representative for a concrete method it is possible to associate (predetermined) properties with (selected) library methods even if those methods are not part of the analysis.

   Definition Classes

   IntermediateESimpleP → EOptionP

   Note

   Entities have to implement equals/hashCode methods which are very efficient, because entity based comparisons happen very frequently!

9.  final def eq(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

10.  def equals(other: Any): Boolean

    Definition Classes

    IntermediateESimpleP → AnyRef → Any

11.  def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

12.  final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

13.  final def hasNoProperty: Boolean

    Definition Classes

    EOptionP

14.  final def hasProperty: Boolean
    returns

    true if the entity is associated with a (preliminary) property.

    Definition Classes

    EPS → EOptionP

15.  def hashCode(): Int

    Definition Classes

    IntermediateESimpleP → AnyRef → Any

16.  def is(p: AnyRef): Boolean

    Combines the test if we have a final property and – if we have one – if it is equal (by means of equality check) to the given one.

    Combines the test if we have a final property and – if we have one – if it is equal (by means of equality check) to the given one.

    Definition Classes

    EOptionP

17.  def isFinal: Boolean

    Returns true if and only if we have a property and the property was stored in the store using (Multi)Result.

    Returns true if and only if we have a property and the property was stored in the store using (Multi)Result.

    Definition Classes

    IntermediateESimpleP → EOptionP

18.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

19.  final def isRefinable: Boolean

    Definition Classes

    EOptionP

20.  def lb: P

    Returns the lower bound of the property if it is available, otherwise an UnsupportedOperationException is thrown.

    Returns the lower bound of the property if it is available, otherwise an UnsupportedOperationException is thrown. For details regarding the precise semantics see the discussion for ub.

    Definition Classes

    IntermediateESimpleP → EOptionP

    Note

    If the property is final, the lb (and ub) will return the final property p.

    ,

    For simple properties an IllegalArgumentException is thrown.

21.  final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

22.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

23.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

24.  final def pk: PropertyKey[P]

    The property key of the optionally available property.

    The property key of the optionally available property.

    Definition Classes

    EPS → EOptionP

25.  final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes

    AnyRef

26.  final def toEPK: EPK[E, P]

    This EOptionP as a pair of an entity and a property key.

    This EOptionP as a pair of an entity and a property key.

    Definition Classes

    EPS → EOptionP

27.  def toString(): String

    Definition Classes

    IntermediateESimpleP → AnyRef → Any

28.  final def toUBEP: FinalEP[E, P]

    Creates a FinalEP object using the current ub.

    Creates a FinalEP object using the current ub.

    Definition Classes

    EPS → EOptionP

    Note

    No check is done whether the property is actually final.

29.  val ub: P

    Returns the upper bound of the property if it is available – hasProperty has to be true – otherwise an UnsupportedOperationException is thrown.

    Returns the upper bound of the property if it is available – hasProperty has to be true – otherwise an UnsupportedOperationException is thrown.

    The upper bound always models the best/most precise result w.r.t. the underlying lattice. Here, "best" means that the set of potentially reachable states/instructions that the analyzed program can ever assume, is potentially smaller when compared to a worse property.

    The upper bound models the sound and precise result under the assumption that the properties of all explicitly and implicitly relevant entities is as last queried or implicitly assumed. I.e., unless a dependee is updated the upper bound represents the correct and most precise result. The upper bound also models the extension of simple properties.

    The lower bound models the worst case property that a specific entity can have under the assumption that all other relevant properties will get their worst properties. This can – but does not have to be – the underlying lattice's bottom value. The lower bound is generally helpful for client analyses to determine final results quicker. For example, imagine the following code:

    def f(a : AnyRef) : Unit = a match {
      case a : List[_] => if (a.exists( _ == null)) throw  new IllegalArgumentException
      case _ => throw new UnknownError
    }
    def m(){
      try {
        f(List(1,2,3))
      } catch {
        case nfe:  NumberFormatException => ...
      }
    }

    In that case (assuming we do not perform context sensitive analyses), if the lower bound for f for the set of thrown exceptions is determined to be Set(IllegalArgumentException,UnkownError), the catch of the NumberFormatException can be ruled out and a final result for m can be computed.

    Definition Classes

    IntermediateESimpleP → EOptionP

    Note

    If the property is final, the lb (and ub) will return the final property p.

30.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

31.  final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

32.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @native() @throws( ... )