mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2026-07-12 10:06:23 +00:00
Code Activity

Explicit formula for length computation of regexes

Browse source
This commit is contained in:
CEisenhofer 2026-06-28 14:14:52 +02:00
parent e983bc76d4
commit 79cdc91a75
8 changed files with 288 additions and 49 deletions
Download patch file Download diff file Expand all files Collapse all files

2
src/params/smt_params.cpp
View file

@ -60,6 +60,7 @@ void smt_params::updt_local_params(params_ref const & _p) {
m_nseq_regex_precheck = p.nseq_regex_precheck();
m_nseq_regex_factorization_threshold = p.nseq_regex_factorization_threshold();
m_nseq_regex_factorization_eager = p.nseq_regex_factorization_eager();
m_nseq_regex_dynamic_decomposition = p.nseq_regex_dynamic_decomposition();
m_nseq_signature = p.nseq_signature();
m_nseq_axiomatize_diseq = p.nseq_axiomatize_diseq();
m_nseq_eager = p.nseq_eager();
@ -178,6 +179,7 @@ void smt_params::display(std::ostream & out) const {
DISPLAY_PARAM(m_nseq_regex_precheck);
DISPLAY_PARAM(m_nseq_regex_factorization_threshold);
DISPLAY_PARAM(m_nseq_regex_factorization_eager);
DISPLAY_PARAM(m_nseq_regex_dynamic_decomposition);
DISPLAY_PARAM(m_nseq_axiomatize_diseq);
DISPLAY_PARAM(m_profile_res_sub);

1
src/params/smt_params.h
View file

@ -255,6 +255,7 @@ struct smt_params : public preprocessor_params,
bool m_nseq_regex_precheck = true;
unsigned m_nseq_regex_factorization_threshold = 1;
bool m_nseq_regex_factorization_eager = false;
bool m_nseq_regex_dynamic_decomposition = true;
bool m_nseq_signature = false;
bool m_nseq_axiomatize_diseq = false;
bool m_nseq_eager = true;

1
src/params/smt_params_helper.pyg
View file

@ -139,6 +139,7 @@ def_module_params(module_name='smt',
('nseq.regex_precheck', BOOL, True, 'enable regex membership pre-check before DFS in theory_nseq: checks intersection emptiness per-variable and short-circuits SAT/UNSAT for regex-only problems'),
('nseq.regex_factorization_threshold', UINT, 1, 'maximum number of cases to factor a classical regex into in a single step (gives completeness on classical regexes)'),
('nseq.regex_factorization_eager', BOOL, False, 'apply regex factorization (sigma splitting) eagerly in the theory interface (propagate_pos_mem) instead of lazily inside the Nielsen graph'),
('nseq.regex_dynamic_decomposition', BOOL, True, 'decompose cyles detected by unwinding regexes'),
('nseq.signature', BOOL, False, 'enable heuristic signature-based string equation splitting in Nielsen solver'),
('nseq.axiomatize_diseq', BOOL, False, 'eagerly axiomatize sequence disequalities'),
('nseq.eager', BOOL, True, 'enable the incremental eager structural Nielsen closure during propagation, detecting conflicts before final_check'),