mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2026-03-01 03:11:30 +00:00
Code Activity

regex length linearity check WIP

Browse source
This commit is contained in:
Murphy Berzish 2018-01-16 13:16:31 -05:00
parent 191cc30e2a
commit 6c4c9a10e4
2 changed files with 36 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

34
src/smt/theory_str.cpp
View file

@ -6604,6 +6604,40 @@ namespace smt {
return 1;
}
}
// Check whether a regex translates well to a linear set of length constraints.
bool theory_str::check_regex_length_linearity(expr * re) {
return check_regex_length_linearity_helper(re, false);
}
bool theory_str::check_regex_length_linearity_helper(expr * re, bool already_star) {
expr * sub1;
expr * sub2;
if (u.re.is_to_re(re)) {
return true;
} else if (u.re.is_concat(re, sub1, sub2)) {
return check_regex_length_linearity_helper(sub1, already_star) && check_regex_length_linearity_helper(sub2, already_star);
} else if (u.re.is_union(re, sub1, sub2)) {
return check_regex_length_linearity_helper(sub1, already_star) && check_regex_length_linearity_helper(sub2, already_star);
} else if (u.re.is_star(re, sub1) || u.re.is_plus(re, sub1)) {
if (already_star) {
return false;
} else {
return check_regex_length_linearity_helper(sub1, true);
}
} else if (u.re.is_range(re)) {
return true;
} else if (u.re.is_full(re)) {
return true;
} else if (u.re.is_complement(re)) {
// TODO can we do better?
return false;
} else {
TRACE("str", tout << "WARNING: unknown regex term " << mk_pp(re, get_manager()) << std::endl;);
UNREACHABLE(); return false;
}
}
/*
* Infer all length constraints implied by the given regular expression `re`
* in order to constrain `lenVar` (which must be of sort Int).