Packages

trait StringTheory extends Theory

Generic class describing string theories.

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

Type Members

  1. class RichWord extends AnyRef

    Helper class providing string infix operators

Abstract Value Members

  1. abstract val CharSort: Sort

    Sort representing characters

  2. abstract val RegexSort: Sort

    Sort representing regular expressions

  3. abstract val StringSort: Sort

    Sort representing strings

  4. abstract val _str_++: Predicate

    The predicate corresponding to str_++

  5. abstract val _str_cons: Predicate

    The predicate corresponding to str_cons

  6. abstract val _str_empty: Predicate

    The predicate corresponding to str_empty

  7. abstract val alphabetSize: Int
  8. abstract val asString: Decoder[String]

    Translate a numeric value from a model to a string.

  9. abstract val asStringPartial: Decoder[Option[String]]

    Translate a numeric value from a model to a string.

  10. abstract 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
    Theory
  11. abstract def char2Int(t: ITerm): ITerm

    Convert a character term to an integer term

  12. abstract val char_is_digit: Predicate
  13. abstract val extraIndexedOps: Map[(String, Int), Either[IFunction, Predicate]]
  14. abstract val extraOps: Map[String, Either[IFunction, Predicate]]
  15. abstract 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
    Theory
  16. abstract 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
    Theory
  17. abstract val functions: Seq[IFunction]

    Interpreted functions of the theory

    Interpreted functions of the theory

    Definition Classes
    Theory
  18. abstract def int2Char(t: ITerm): ITerm

    Convert an integer term to a character term

  19. abstract val int_to_str: IFunction
  20. abstract def plugin: Option[Plugin]

    Optionally, a plug-in implementing reasoning in this theory

    Optionally, a plug-in implementing reasoning in this theory

    Definition Classes
    Theory
  21. abstract 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
    Theory
  22. abstract val predicates: Seq[Predicate]

    Interpreted predicates of the theory

    Interpreted predicates of the theory

    Definition Classes
    Theory
  23. abstract val re_*: IFunction
  24. abstract val re_+: IFunction
  25. abstract val re_++: IFunction
  26. abstract val re_all: IFunction
  27. abstract val re_allchar: IFunction
  28. abstract val re_charrange: IFunction
  29. abstract val re_comp: IFunction
  30. abstract val re_diff: IFunction
  31. abstract val re_eps: IFunction
  32. abstract val re_from_str: IFunction
  33. abstract val re_inter: IFunction
  34. abstract val re_loop: IFunction
  35. abstract val re_none: IFunction
  36. abstract val re_opt: IFunction
  37. abstract val re_range: IFunction
  38. abstract val re_union: IFunction
  39. abstract val str_++: IFunction
  40. abstract val str_<: Predicate
  41. abstract val str_<=: Predicate
  42. abstract val str_at: IFunction
  43. abstract val str_char: IFunction
  44. abstract val str_cons: IFunction
  45. abstract val str_contains: Predicate
  46. abstract val str_empty: IFunction
  47. abstract val str_from_char: IFunction
  48. abstract val str_from_code: IFunction
  49. abstract val str_head: IFunction
  50. abstract val str_head_code: IFunction
  51. abstract val str_in_re: Predicate
  52. abstract val str_indexof: IFunction
  53. abstract val str_len: IFunction
  54. abstract val str_prefixof: Predicate
  55. abstract val str_replace: IFunction
  56. abstract val str_replaceall: IFunction
  57. abstract val str_replaceallre: IFunction
  58. abstract val str_replacere: IFunction
  59. abstract val str_substr: IFunction
  60. abstract val str_suffixof: Predicate
  61. abstract val str_tail: IFunction
  62. abstract val str_to_code: IFunction
  63. abstract val str_to_int: IFunction
  64. abstract val str_to_re: IFunction
  65. abstract val totalityAxioms: Formula

    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
    Theory
  66. abstract 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
    Theory

Concrete 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. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @HotSpotIntrinsicCandidate() @native()
  6. 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
  7. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  8. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  9. 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
  10. 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
  11. 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
  12. 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
  13. 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
  14. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  15. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  16. 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
  17. 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
  18. def int2String(t: ITerm): ITerm

    Convert an integer term to a singleton string

  19. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  20. 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
    Theory
  21. 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
  22. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  23. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  24. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  25. 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
  26. 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
  27. 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
  28. 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
  29. 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
  30. implicit def string2Term(str: String): ITerm

    Convert a string to a term

  31. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  32. implicit def term2RichWord(t: ITerm): RichWord

    Convert a term to a rich term, providing some infix operators

  33. def toString(): String
    Definition Classes
    AnyRef → Any
  34. 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
  35. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  36. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  37. 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