Sparse counting-sets reduce replication overhead in c-regex matching by tracking only essential counter values.
In: Computer Aided Verification - 30th International Conference, CA V 2018
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Efficient Regex Matching with Sparse Counting-Sets
Sparse counting-sets reduce replication overhead in c-regex matching by tracking only essential counter values.