class IntValueEnumTheory extends Theory
A theory for explicitly enumerating all values of integer
terms. The proof procedure that will take care of the splitting
will be given the priority specified by
splitterCost. The splitting of the value range of
terms will initially be binary; once the range of possible values
of a term has been narrowed down to at most
completeSplitBound values, in a single step the range
will be split into all individual values. In order to initiate
splitting, literals IntValueEnumTheory.enumPred(t)
have to be added to a proof goal.
- Alphabetic
- By Inheritance
- IntValueEnumTheory
- Theory
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Instance Constructors
- new IntValueEnumTheory(name: String, splitterCost: Int = 0, completeSplitBound: Int = 20, randomiseValues: Boolean = true)
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- val axioms: Conjunction
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
- IntValueEnumTheory → Theory
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @HotSpotIntrinsicCandidate() @native()
- 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
- Theory
- def enumIntValuesOf(t: ITerm): IFormula
Generate an assertion that will cause all values of the given term to be enumerated explicitly.
Generate an assertion that will cause all values of the given term to be enumerated explicitly. The enumeration will be fair, i.e., every possible value of the term will be considered eventually.
- def enumIntValuesOf(t: Term, order: TermOrder): Formula
Generate an assertion that will cause all values of the given term to be enumerated explicitly.
Generate an assertion that will cause all values of the given term to be enumerated explicitly. The enumeration will be fair, i.e., every possible value of the term will be considered eventually.
- val enumPred: Predicate
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- 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
- 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
- def evaluatingSimplifier(t: IExpression): IExpression
A simplification function that applies the methods
evalFunandevalPredto some given expression (but not recursively).A simplification function that applies the methods
evalFunandevalPredto some given expression (but not recursively). This is used in theTheory.postSimplifiersmethods.- Definition Classes
- Theory
- def extend(order: TermOrder): TermOrder
Add the symbols defined by this theory to the
orderAdd the symbols defined by this theory to the
order- Definition Classes
- Theory
- val functionPredicateMapping: List[Nothing]
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
- IntValueEnumTheory → Theory
- 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
- IntValueEnumTheory → Theory
- val functions: List[Nothing]
Interpreted functions of the theory
Interpreted functions of the theory
- Definition Classes
- IntValueEnumTheory → Theory
- 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
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- 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
- 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
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- 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
- IntValueEnumTheory → Theory
- val magnitudeBoundPred: Predicate
- val modelGenPredicates: Set[Predicate]
Optionally, a set of predicates used by the theory to tell the
PresburgerModelFinderabout terms that will be handled exclusively by this theory.Optionally, a set of predicates used by the theory to tell the
PresburgerModelFinderabout terms that will be handled exclusively by this theory. If a proof goal in model generation mode contains an atomp(x), forpin this set, then thePresburgerModelFinderwill ignorexwhen assigning concrete values to symbols.- Definition Classes
- Theory
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @HotSpotIntrinsicCandidate() @native()
- val plugin: Some[Plugin]
Optionally, a plug-in implementing reasoning in this theory
Optionally, a plug-in implementing reasoning in this theory
- Definition Classes
- IntValueEnumTheory → Theory
- 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 theevaluatingSimplifier.- Definition Classes
- Theory
- 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
- 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
- IntValueEnumTheory → Theory
- val predicates: List[Predicate]
Interpreted predicates of the theory
Interpreted predicates of the theory
- Definition Classes
- IntValueEnumTheory → Theory
- 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
- 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
- val singleInstantiationPredicates: Set[Predicate]
When instantiating existentially quantifier formulas,
EX phi, at most one instantiation is necessary provided that all predicates inphiare contained in this set.When instantiating existentially quantifier formulas,
EX phi, at most one instantiation is necessary provided that all predicates inphiare contained in this set.- Definition Classes
- Theory
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toString(): String
- Definition Classes
- AnyRef → Any
- val totalityAxioms: Conjunction
Additional axioms that are included if the option
+genTotalityAxiomsis given to Princess.Additional axioms that are included if the option
+genTotalityAxiomsis given to Princess.- Definition Classes
- IntValueEnumTheory → Theory
- 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
- 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
- IntValueEnumTheory → Theory
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
(Since version 9)