SeqStringTheory
Related Docs:
object SeqStringTheory
| package strings
Translator from atoms representing regexes in a goal to the corresponding term.
Translator from atoms representing regexes in a goal to the corresponding term.
Helper class providing string infix operators
Helper class providing string infix operators
Sort representing characters
Sort representing characters
Extractor to identify regular expressions that are completely defined, i.e., in which no sub-terms are left symbolic.
Extractor to identify regular expressions that are completely defined, i.e., in which no sub-terms are left symbolic.
Sort representing regular expressions
Sort representing regular expressions
Sort representing strings
Sort representing strings
The predicate corresponding to str_++
The predicate corresponding to str_++
The predicate corresponding to str_cons
The predicate corresponding to str_cons
The predicate corresponding to str_empty
The predicate corresponding to str_empty
Translate a numeric value from a model to a string.
Translate a numeric value from a model to a string.
Translate a numeric value from a model to a string.
Translate a numeric value from a model to a string.
Augment goal facts with the given assignment of strings to terms.
Augment goal facts with the given assignment of strings to terms. At the moment this assumes that all string terms are constants.
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).
Check for cyclic word equations induced by str_++
or str_cons, and break those.
Check for cyclic word equations induced by str_++
or str_cons, and break those.
e.g., equations x = yz & y = ax -> z = eps & a = eps & y = ax
Tarjan's algorithm is used to find all strongly connected components
Convert a character term to an integer term
Convert a character term to an integer term
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.
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.
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.
Add the symbols defined by this theory to the order
Add the symbols defined by this theory to the order
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).
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
Interpreted functions of the theory
Interpreted functions of the theory
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.
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.
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.
Convert an integer term to a character term
Convert an integer term to a character term
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.
Optionally, a plug-in implementing reasoning in this theory
Optionally, a plug-in implementing reasoning in this theory
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 with ap.parser.Simplifier.
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.
Information how interpreted predicates should be handled for e-matching.
Information how interpreted predicates should be handled for e-matching.
Interpreted predicates of the theory
Interpreted predicates of the theory
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.
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.
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.
Convert a string to a term
Convert a string to a term
Convert a term to a rich term, providing some infix operators
Convert a term to a rich term, providing some infix operators
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.
A list of functions that should be considered in automatic trigger generation
A list of functions that should be considered in automatic trigger generation
String theory implemented using a list ADT.