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 ExtArray extends Theory

Theory of extensional arrays.

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

Instance Constructors

  1. new ExtArray(indexSorts: Seq[Sort], objSort: Sort)

Type Members

  1. class Reducer extends ReducerPlugin

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 _const: Predicate
  5. val _select: Predicate
  6. val _store: Predicate
  7. val _store2: Predicate
  8. val _valueAlmostEverywhere: Predicate
  9. val allAxioms: IFormula
  10. val arity: Int
  11. val arrayConstant: Predicate
  12. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  13. val axiom1: IFormula
  14. val axiom2: IFormula
  15. val axiom3: IFormula
  16. val axiom4: IFormula
  17. val axiom5: IFormula
  18. val axiom6: IFormula
  19. val axiom7: IFormula
  20. val axiom8: IFormula
  21. 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
    ExtArray → Theory
  22. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @HotSpotIntrinsicCandidate() @native()
  23. val const: IFunction

    Function for constant arrays.

  24. val constArray: IFunction

    Java-friendly copy of the const function.

  25. val dependencies: Seq[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
    ExtArray → Theory
  26. val distinctArrays: Predicate
  27. def distinctArraysAxiom(c: Term, d: Term)(implicit order: TermOrder): Conjunction
  28. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  29. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  30. def evalFun(f: IFunApp): Option[ITerm]

    Direct evaluation of some ground terms.

    Direct evaluation of some ground terms.

    Definition Classes
    ExtArray → Theory
  31. 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
  32. 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
  33. def expandExtensionality(goal: Goal, additionalFuns: Seq[(Predicate, Seq[Int])] = List()): Seq[Action]

    The extensionality axiom is implemented by rewriting negated equations about arrays.

    The extensionality axiom is implemented by rewriting negated equations about arrays.

    Attributes
    protected[arrays]
  34. 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
  35. val funPredMap: Map[IFunction, Predicate]
  36. val functionPredicateMapping: List[(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
    ExtArray → Theory
  37. 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
    ExtArray → Theory
  38. val functions: List[IFunction]

    Interpreted functions of the theory

    Interpreted functions of the theory

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

    Optionally, a plug-in implementing reasoning in this theory

    Optionally, a plug-in implementing reasoning in this theory

    Definition Classes
    ExtArray → Theory
  53. val 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
    ExtArray → Theory
  54. 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
  55. 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
    ExtArray → Theory
  56. val predicates: Seq[Predicate]

    Interpreted predicates of the theory

    Interpreted predicates of the theory

    Definition Classes
    ExtArray → Theory
  57. 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
  58. val reducerPlugin: ReducerFactory.type

    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
    ExtArray → Theory
  59. val select: IFunction

    Function for reading an element of the array.

  60. 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
  61. val sort: ArraySort
  62. val store: IFunction

    Function for updating an array at given indexes.

  63. val store2: IFunction
  64. def store2store2Lazy(goal: Goal, checkedPreds: Seq[Predicate] = List(_store, _store2, _const)): Seq[Action]

    When the "store" literals form a graph that is not tree-shaped, start replacing "store" with "store2" to initiate bidirectional propagation

    When the "store" literals form a graph that is not tree-shaped, start replacing "store" with "store2" to initiate bidirectional propagation

    TODO: do we have to do something special about cycles in the graph?

    TODO: the current code is converting more store to store2 than necessary;

    Attributes
    protected[arrays]
  65. def storeConversionActions(a: Atom, goal: Goal): Seq[Action]
    Attributes
    protected[arrays]
  66. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  67. def toString(): String
    Definition Classes
    ExtArray → 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
    ExtArray → 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
    ExtArray → Theory
  71. val valueAlmostEverywhere: IFunction
  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. object ReducerFactory extends ReducerPluginFactory

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