Given known regex constraints for function arguments and function result, derive a sequence of regex constraints for the arguments such that
Given known regex constraints for function arguments and function result, derive a sequence of regex constraints for the arguments such that
If the result depends on the given argumentConstraints
,
then the used constraints also have to be returned as second result
component.
Generate a formula that approximates the character count (=
Parikh) relationship between arguments and result, for one
particular letter char
.
Generate a formula that approximates the character count (=
Parikh) relationship between arguments and result, for one
particular letter char
. It is sound to just return
true
. The parameters arguments
and
result
are terms representing the length of the
string arguments.
Evaluate the described function; return None
if the
function is not defined for the given arguments.
Evaluate the described function; return None
if the
function is not defined for the given arguments.
Given constraints on the input variables, produce an over-approximation constraint on the output.
Given constraints on the input variables, produce an over-approximation constraint on the output.
Generate a formula that approximates the length relationship between arguments and result.
Generate a formula that approximates the length relationship
between arguments and result. It is sound to just return
true
. The parameters arguments
and
result
are terms representing the length of the
string arguments.
argumentConstraints(0) is the automaton of the string term to search. argumentConstraints(1)(0) is the automaton of the constant substring. We generate a new automaton for the searched string term.