Packages

abstract class ReduceWithInEqs extends AnyRef

Reduce certain terms or formulas drawing information from inequalities that are assumed as facts.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ReduceWithInEqs
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new ReduceWithInEqs()

Abstract Value Members

  1. abstract def addInEqs(furtherInEqs: InEqConj): ReduceWithInEqs
  2. abstract def apply(conj: InEqConj): InEqConj

    Reduce a conjunction of inequalities.

    Reduce a conjunction of inequalities. This means that subsumed inequalities are removed, contradictions are detected, and possibly further equations are inferred.

  3. abstract def apply(conj: NegEquationConj, logger: ComputationLogger): (NegEquationConj, InEqConj)

    Reduce a conjunction of negated equations by removing all equations from which we know that they hold anyway.

    Reduce a conjunction of negated equations by removing all equations from which we know that they hold anyway. This will also turn disequalities into inequalities if possible.

  4. abstract def apply(conj: EquationConj): EquationConj
  5. abstract def lowerBound(t: Term): Option[IdealInt]

    Check whether the known inequalities imply a lower bound of the given term.

  6. abstract def lowerBoundWithAssumptions(t: Term): Option[(IdealInt, Seq[LinearCombination])]

    Check whether the known inequalities imply a lower bound of the given term.

    Check whether the known inequalities imply a lower bound of the given term. Also return assumed inequalities needed to derive the bound.

  7. abstract def passQuantifiers(num: Int): ReduceWithInEqs

    Create a ReduceWithEqs that can be used underneath num binders.

    Create a ReduceWithEqs that can be used underneath num binders. The conversion of de Brujin-variables is done on the fly, which should give a good performance when the resulting ReduceWithEqs is not applied too often (TODO: caching)

  8. abstract def reduceNoEqualityInfs(conj: InEqConj): InEqConj

    Reduce a conjunction of inequalities without implied equations.

    Reduce a conjunction of inequalities without implied equations. (i.e., conj.equalityInfs.isEmpty)

  9. abstract def upperBound(t: Term): Option[IdealInt]

    Check whether the known inequalities imply an upper bound of the given term.

  10. abstract def upperBoundWithAssumptions(t: Term): Option[(IdealInt, Seq[LinearCombination])]

    Check whether the known inequalities imply an upper bound of the given term.

    Check whether the known inequalities imply an upper bound of the given term. Also return assumed inequalities needed to derive the bound.

Concrete 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. def apply(conj: NegEquationConj): (NegEquationConj, InEqConj)

    Reduce a conjunction of negated equations by removing all equations from which we know that they hold anyway.

    Reduce a conjunction of negated equations by removing all equations from which we know that they hold anyway. This will also turn disequalities into inequalities if possible.

  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @HotSpotIntrinsicCandidate() @native()
  7. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  8. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  9. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  10. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  11. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  12. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  13. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  14. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  15. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  16. def toString(): String
    Definition Classes
    AnyRef → Any
  17. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  18. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  19. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated

    (Since version 9)

Inherited from AnyRef

Inherited from Any

Ungrouped