Packages

  • package root
    Definition Classes
    root
  • package ap

    Package object making available some of the objects in sub-packages

    Package object making available some of the objects in sub-packages

    Definition Classes
    root
  • package theories

    Package object making available some of the objects in sub-packages

    Package object making available some of the objects in sub-packages

    Definition Classes
    ap
  • package arrays
    Definition Classes
    theories
  • CombArray
  • ExtArray
  • SetTheory
  • SimpleArray

class CombArray extends Theory

A theory of combinatorial arrays.

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

Instance Constructors

  1. new CombArray(subTheories: IndexedSeq[theories.ExtArray], combinatorSpecs: IndexedSeq[CombinatorSpec], extraDependencies: Seq[Theory] = List())

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. val _combinators: IndexedSeq[Predicate]
  5. val _combinators2: IndexedSeq[Predicate]
  6. val allAxioms: IFormula
  7. val arraySorts: IndexedSeq[ArraySort]
  8. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  9. val axiom1: IFormula
  10. val axiom2: IFormula
  11. 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
    CombArray → Theory
  12. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @HotSpotIntrinsicCandidate() @native()
  13. def comb2comb2Eager(goal: Goal, subTheoryInd: Int, arrayTerms: Set[LinearCombination]): Seq[Action]
    Attributes
    protected[arrays]
  14. def comb2comb2Lazy(goal: Goal, subTheoryInd: Int, checkedPreds: Seq[Predicate], checkComb: Boolean): Seq[Action]
    Attributes
    protected[arrays]
  15. val combinatorSpecs: IndexedSeq[CombinatorSpec]
  16. val combinators: IndexedSeq[IFunction]

    The functions resulting from lifting the object combinators to arrays.

  17. val combinators2: IndexedSeq[IFunction]

    The functions resulting from lifting the object combinators to arrays.

  18. val combinators2PerArray: IndexedSeq[IndexedSeq[Predicate]]
    Attributes
    protected[arrays]
  19. val combinators2PerArrayArgs: IndexedSeq[IndexedSeq[(Predicate, Seq[Int])]]
    Attributes
    protected[arrays]
  20. val combinatorsPerArray: IndexedSeq[IndexedSeq[Predicate]]
    Attributes
    protected[arrays]
  21. def consumedArrayTerms(goal: Goal, subTheoryInd: Int): Set[LinearCombination]
    Attributes
    protected[arrays]
  22. val dependencies: IndexedSeq[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
    CombArray → Theory
  23. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  24. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  25. 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
    Theory
  26. 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
  27. 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
  28. def expandExtensionality(goal: Goal, extTheoryInd: Int, additionalFuns: Seq[(Predicate, Seq[Int])] = List()): Seq[Action]
    Attributes
    protected[arrays]
  29. 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
  30. val extraDependencies: Seq[Theory]
  31. val funPredMap: Map[IFunction, Predicate]
  32. val functionPredicateMapping: IndexedSeq[(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
    CombArray → Theory
  33. 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
    CombArray → Theory
  34. val functions: IndexedSeq[IFunction]

    Interpreted functions of the theory

    Interpreted functions of the theory

    Definition Classes
    CombArray → Theory
  35. 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
  36. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  37. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  38. 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
  39. 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
  40. val indexSorts: Seq[Sort]
  41. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  42. 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
    CombArray → Theory
  43. 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
  44. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  45. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  46. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  47. val objSorts: IndexedSeq[Sort]
  48. val plugin: Some[Plugin]

    Optionally, a plug-in implementing reasoning in this theory

    Optionally, a plug-in implementing reasoning in this theory

    Definition Classes
    CombArray → Theory
  49. 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
  50. 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
  51. 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
    CombArray → Theory
  52. val predicates: Seq[Predicate]

    Interpreted predicates of the theory

    Interpreted predicates of the theory

    Definition Classes
    CombArray → Theory
  53. 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
    Theory
  54. 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
  55. 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
  56. val subTheories: IndexedSeq[theories.ExtArray]
  57. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  58. def toString(): String
    Definition Classes
    CombArray → AnyRef → Any
  59. 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
    CombArray → Theory
  60. 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
  61. 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
    CombArray → Theory
  62. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  63. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  64. 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 Theory

Inherited from AnyRef

Inherited from Any

Ungrouped