Woorpje solves bounded word equations by encoding NFA reachability as SAT problems, achieving competitive results and exposing bugs in prior solvers.
Proceedings of the ACM on Programming Languages 3(POPL) , 49 (2019)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On Solving Word Equations Using SAT
Woorpje solves bounded word equations by encoding NFA reachability as SAT problems, achieving competitive results and exposing bugs in prior solvers.