Packages

class ADT extends SMTLinearisableTheory

Theory solver for algebraic data-types.

Linear Supertypes
SMTLinearisableTheory, Theory, AnyRef, Any
Known Subclasses
BoolADT
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ADT
  2. SMTLinearisableTheory
  3. Theory
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new ADT(sortNames: Seq[String], ctorSignatures: Seq[(String, CtorSignature)], measure: ADT.TermMeasure.Value = ADT.TermMeasure.RelDepth, overrideDeps: Option[Seq[Theory]] = None)

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 SMTDeclarationSideEffects: Seq[Theory]

    A list of (other) theories that are implicitly declared as a side-effect of declaring this theory.

    A list of (other) theories that are implicitly declared as a side-effect of declaring this theory. We assume that theories can implicitly define some of their dependencies, but not vice versa.

    Definition Classes
    SMTLinearisableTheory
  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. val axioms: Formula

    Axioms defining the theory; such axioms are simply added as formulae to the problem to be proven, and thus handled using the standard reasoning techniques (including e-matching).

    Axioms defining the theory; such axioms are simply added as formulae to the problem to be proven, and thus handled using the standard reasoning techniques (including e-matching).

    Definition Classes
    ADT → Theory
  7. val cardinalities: Seq[Option[IdealInt]]

    The number of elements per sort, or None for infinite sorts.

  8. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @HotSpotIntrinsicCandidate() @native()
  9. val constructorPreds: IndexedSeq[Predicate]
  10. val constructors: IndexedSeq[MonoSortedIFunction]

    The constructors of the ADT

  11. val ctorId2PerSortId: IndexedSeq[Int]
    Attributes
    protected[ap]
  12. val ctorIdPreds: IndexedSeq[Predicate]
  13. val ctorIds: IndexedSeq[MonoSortedIFunction]

    Function symbols representing the index of the head symbol of a constructor term

  14. def ctorIdsPerSort: IndexedSeq[IndexedSeq[Int]]

    List the constructors belonging to each sort; the constructors are identified with the position of a constructor in the sequence ctorSignatures.

  15. def ctorTermSize(f: ITerm): Option[Int]

    Compute the size (number of constructor occurrences) of a constructor term; return None if parts of the term are symbolic, and the size cannot be determined.

  16. val dependencies: Iterable[Theory]

    Optionally, other theories that this theory depends on.

    Optionally, other theories that this theory depends on. Specified dependencies will be loaded before this theory, but the preprocessors of the dependencies will be called after the preprocessor of this theory.

    Definition Classes
    ADT → Theory
  17. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  18. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  19. def evalFun(f: IFunApp): Option[ITerm]

    Optionally, a function evaluating theory functions applied to concrete arguments, represented as constructor terms.

    Optionally, a function evaluating theory functions applied to concrete arguments, represented as constructor terms.

    Definition Classes
    ADT → Theory
  20. def evalPred(p: IAtom): Option[Boolean]

    Optionally, a function evaluating theory predicates applied to concrete arguments, represented as constructor terms.

    Optionally, a function evaluating theory predicates applied to concrete arguments, represented as constructor terms.

    Definition Classes
    Theory
  21. def evaluatingSimplifier(t: IExpression): IExpression

    A simplification function that applies the methods evalFun and evalPred to some given expression (but not recursively).

    A simplification function that applies the methods evalFun and evalPred to some given expression (but not recursively). This is used in the Theory.postSimplifiers methods.

    Definition Classes
    Theory
  22. def extend(order: TermOrder): TermOrder

    Add the symbols defined by this theory to the order

    Add the symbols defined by this theory to the order

    Definition Classes
    Theory
  23. def fun2SMTString(f: IFunction): Option[String]

    Translate a function belonging to this theory to an SMT-LIB identifier.

    Translate a function belonging to this theory to an SMT-LIB identifier.

    Definition Classes
    SMTLinearisableTheory
  24. val functionPredicateMapping: Seq[(IFunction, Predicate)]

    Mapping of interpreted functions to interpreted predicates, used translating input ASTs to internal ASTs (the latter only containing predicates).

    Mapping of interpreted functions to interpreted predicates, used translating input ASTs to internal ASTs (the latter only containing predicates).

    Definition Classes
    ADT → Theory
  25. val functionTranslation: Map[IFunction, Predicate]
  26. val functionalPredicates: Set[Predicate]

    Information which of the predicates satisfy the functionality axiom; at some internal points, such predicates can be handled more efficiently

    Information which of the predicates satisfy the functionality axiom; at some internal points, such predicates can be handled more efficiently

    Definition Classes
    ADT → Theory
  27. val functions: Seq[IFunction]

    Interpreted functions of the theory

    Interpreted functions of the theory

    Definition Classes
    ADT → Theory
  28. def generateDecoderData(model: Conjunction): Option[TheoryDecoderData]

    If this theory defines any Theory.Decoder, which can translate model data into some theory-specific representation, this function can be overridden to pre-compute required data from a model.

    If this theory defines any Theory.Decoder, which can translate model data into some theory-specific representation, this function can be overridden to pre-compute required data from a model.

    Definition Classes
    Theory
  29. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  30. def getCtorPerSort(sortNum: Int, ctorNum: Int): MonoSortedIFunction

    Get the constructor number ctorNum of sort sortNum.

  31. def hasCtor(t: ITerm, id: Int): IFormula

    Query the constructor type of a term; the given id is the position of a constructor in the sequence ctorSignatures.

  32. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  33. def iPostprocess(f: IFormula, signature: Signature): IFormula

    Optionally, a post-processor that is applied to formulas output by the prover, for instance to interpolants or the result of quantifier elimination.

    Optionally, a post-processor that is applied to formulas output by the prover, for instance to interpolants or the result of quantifier elimination. This method will be applied to the formula after calling Internal2Inputabsy.

    Definition Classes
    Theory
  34. def iPreprocess(f: IFormula, signature: Signature): (IFormula, Signature)

    Optionally, a pre-processor that is applied to formulas over this theory, prior to sending the formula to a prover.

    Optionally, a pre-processor that is applied to formulas over this theory, prior to sending the formula to a prover. This method will be applied very early in the translation process.

    Definition Classes
    Theory
  35. val isEnum: IndexedSeq[Boolean]

    Enum sorts, i.e., sorts with only nullary constructors.

  36. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  37. lazy val isRecursive: IndexedSeq[Boolean]

    Recursive sorts, i.e., sorts that can appear (directly or indirectly) as sort of subterms of its own terms.

  38. def isSoundForSat(theories: Seq[Theory], config: Theory.SatSoundnessConfig.Value): Boolean

    Check whether we can tell that the given combination of theories is sound for checking satisfiability of a problem, i.e., if proof construction ends up in a dead end, can it be concluded that a problem is satisfiable.

    Check whether we can tell that the given combination of theories is sound for checking satisfiability of a problem, i.e., if proof construction ends up in a dead end, can it be concluded that a problem is satisfiable.

    Definition Classes
    ADT → Theory
  39. val modelGenPredicates: Set[Predicate]

    Optionally, a set of predicates used by the theory to tell the PresburgerModelFinder about terms that will be handled exclusively by this theory.

    Optionally, a set of predicates used by the theory to tell the PresburgerModelFinder about terms that will be handled exclusively by this theory. If a proof goal in model generation mode contains an atom p(x), for p in this set, then the PresburgerModelFinder will ignore x when assigning concrete values to symbols.

    Definition Classes
    Theory
  40. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  41. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  42. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  43. lazy val parikhSizeConstraints: IndexedSeq[Conjunction]
  44. def plugin: Option[Plugin]

    Optionally, a plug-in implementing reasoning in this theory

    Optionally, a plug-in implementing reasoning in this theory

    Definition Classes
    ADT → Theory
  45. def postSimplifiers: Seq[(IExpression) => IExpression]

    Optionally, simplifiers that are applied to formulas output by the prover, for instance to interpolants or the result of quantifier.

    Optionally, simplifiers that are applied to formulas output by the prover, for instance to interpolants or the result of quantifier. Such simplifiers are invoked by ap.parser.Simplifier. By default, this list will only include the evaluatingSimplifier.

    Definition Classes
    Theory
  46. def postprocess(f: Conjunction, order: TermOrder): Conjunction

    Optionally, a post-processor that is applied to formulas output by the prover, for instance to interpolants or the result of quantifier elimination.

    Optionally, a post-processor that is applied to formulas output by the prover, for instance to interpolants or the result of quantifier elimination. This method will be applied to the raw formulas, before calling Internal2Inputabsy.

    Definition Classes
    Theory
  47. def pred2SMTString(p: Predicate): Option[String]

    Translate a predicate belonging to this theory to an SMT-LIB identifier.

    Translate a predicate belonging to this theory to an SMT-LIB identifier.

    Definition Classes
    SMTLinearisableTheory
  48. val predicateMatchConfig: PredicateMatchConfig

    Information how interpreted predicates should be handled for e-matching.

    Information how interpreted predicates should be handled for e-matching.

    Definition Classes
    ADT → Theory
  49. val predicates: Seq[Predicate]

    Interpreted predicates of the theory

    Interpreted predicates of the theory

    Definition Classes
    ADT → Theory
  50. def preprocess(f: Conjunction, order: TermOrder): Conjunction

    Optionally, a pre-processor that is applied to formulas over this theory, prior to sending the formula to a prover.

    Optionally, a pre-processor that is applied to formulas over this theory, prior to sending the formula to a prover.

    Definition Classes
    ADT → Theory
  51. def printSMTDeclaration: Unit

    Print an SMT-LIB declaration of this theory; do not output anything if the theory does not need to be declared.

    Print an SMT-LIB declaration of this theory; do not output anything if the theory does not need to be declared.

    Definition Classes
    ADT → SMTLinearisableTheory
  52. val reducerPlugin: ReducerPluginFactory

    Optionally, a plugin for the reducer applied to formulas both before and during proving.

    Optionally, a plugin for the reducer applied to formulas both before and during proving.

    Definition Classes
    Theory
  53. def rewriteADTFormula(f: Conjunction, order: TermOrder): Conjunction

    Rewrite a formula prior to solving; e.g., add selector and tester constraints

  54. val selectorPreds: IndexedSeq[Seq[Predicate]]
  55. val selectors: IndexedSeq[Seq[MonoSortedIFunction]]

    The selectors of the ADT

  56. val singleInstantiationPredicates: Set[Predicate]

    When instantiating existentially quantifier formulas, EX phi, at most one instantiation is necessary provided that all predicates in phi are contained in this set.

    When instantiating existentially quantifier formulas, EX phi, at most one instantiation is necessary provided that all predicates in phi are contained in this set.

    Definition Classes
    Theory
  57. lazy val sizeLowerBound: IndexedSeq[IdealInt]
  58. def sort2SMTType(s: Sort): Option[SMTType]

    Translate a sort belonging to this theory to an SMT type.

    Translate a sort belonging to this theory to an SMT type.

    Definition Classes
    SMTLinearisableTheory
  59. def sortOfCtor(ctorNum: Int): Int

    The sort sorts(n) belonging to the constructor constructors(ctorNum).

  60. lazy val sortSCCs: IndexedSeq[Seq[Int]]

    The strongly connected components among the ADTs sorts.

  61. val sorts: IndexedSeq[ADTProxySort]
  62. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  63. val termDepth: IndexedSeq[MonoSortedIFunction]

    Function symbols representing (relative) depth of constructor terms.

    Function symbols representing (relative) depth of constructor terms. The symbols are only available for measure == ADT.TermMeasure.RelDepth

  64. val termDepthPreds: IndexedSeq[Predicate]
  65. val termSize: IndexedSeq[MonoSortedIFunction]

    Function symbols representing absolute size of constructor terms.

    Function symbols representing absolute size of constructor terms. The symbols are only available for measure == ADT.TermMeasure.Size

  66. val termSizePreds: IndexedSeq[Predicate]
  67. def toString(): String
    Definition Classes
    ADT → AnyRef → Any
  68. val totalityAxioms: Conjunction

    Additional axioms that are included if the option +genTotalityAxioms is given to Princess.

    Additional axioms that are included if the option +genTotalityAxioms is given to Princess.

    Definition Classes
    ADT → Theory
  69. lazy val transitiveDependencies: Iterable[Theory]

    Dependencies closed under transitivity, i.e., also including the dependencies of dependencies.

    Dependencies closed under transitivity, i.e., also including the dependencies of dependencies.

    Definition Classes
    Theory
  70. val triggerRelevantFunctions: Set[IFunction]

    A list of functions that should be considered in automatic trigger generation

    A list of functions that should be considered in automatic trigger generation

    Definition Classes
    ADT → Theory
  71. lazy val uniqueTermSize: IndexedSeq[Option[IdealInt]]
  72. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  73. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  74. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  75. val witnesses: Seq[ITerm]
  76. object SortNum

    Extractor to recognise sorts belonging to this ADT.

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 SMTLinearisableTheory

Inherited from Theory

Inherited from AnyRef

Inherited from Any

Ungrouped