Trait

old

UnrTheoryDecorator

Related Doc: package old

Permalink

trait UnrTheoryDecorator extends UnreliabilityTheory

Self Type
UnrTheoryDecorator with Parsing with SMTTranslation with STMDDBuilder
Linear Supertypes
UnreliabilityTheory, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. UnrTheoryDecorator
  2. UnreliabilityTheory
  3. AnyRef
  4. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. def computeUnrWithMemo(choice: Map[CompInstanceIdent, CompAlternative]): ProbMeasure

    Permalink

    Calcul une surapprox, sous approx et valeur reel (si le choix est complet) de la defiabilite

    Calcul une surapprox, sous approx et valeur reel (si le choix est complet) de la defiabilite

    choice

    choix de selection de substiution

    returns

    une mesure de la defibailite

    Definition Classes
    UnreliabilityTheory
  7. def computeUnrWithoutMemo(choice: Map[CompInstanceIdent, CompAlternative]): ProbMeasure

    Permalink
    Definition Classes
    UnreliabilityTheory
  8. val enumVarSafeUnrCache: HashMap[PathIdentType, SubstitutionVar]

    Permalink

    Theorie de la defiabilite qui renvoi pour un choix donnee le status et la clause de conflit si status est UNSAT sinon le choix initial.

    Theorie de la defiabilite qui renvoi pour un choix donnee le status et la clause de conflit si status est UNSAT sinon le choix initial. On parcours l'arbre des traces avec un budget de defiabilite a depenser, on calcul donc les long des chemins une borne min, max et si possible reel de la defiabilite. Si au bout de l'evaluation d'un groupe de chemins la reponse est UNSAT alors on sait que le modele n'est pas satisfaisant. Dans le cas d'une valuation incomplete Si la surapprox est correcte le modele est correct, la sous approx est incorrect le modele est incorrect, sinon on ne sait pas.

    returns

    si le modele satisfait ou non les contrainte et une clause de conflit (CNF)

    Definition Classes
    UnreliabilityTheory
  9. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  10. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  11. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  12. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  13. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  14. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  15. def isSafeUnr(obj: Real, choice: Traversable[(SubstitutionVar, Expr)]): (Status, Seq[Seq[BoolExpr]])

    Permalink
  16. def isSafeUnrQuickXplain(objective: Real, model: Traversable[(SubstitutionVar, Expr)]): (Status, Seq[Seq[BoolExpr]])

    Permalink
    Definition Classes
    UnreliabilityTheory
  17. def isSafeUnrSimple(objective: Real, model: Traversable[(SubstitutionVar, Expr)]): (Status, Seq[Seq[BoolExpr]])

    Permalink
    Definition Classes
    UnreliabilityTheory
  18. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  19. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  20. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  21. val outputLogUnr: FileWriter

    Permalink
  22. def quickExplain(model: Traversable[(SubstitutionVar, Expr)], solver: (Seq[(PathIdentType, Option[Int])]) ⇒ Status): (Status, Traversable[(SubstitutionVar, Expr)])

    Permalink
    Definition Classes
    UnreliabilityTheory
  23. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  24. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  25. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  26. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  27. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from UnreliabilityTheory

Inherited from AnyRef

Inherited from Any

Ungrouped