Woorpje solves bounded word equations by encoding NFA reachability as SAT problems, achieving competitive results and exposing bugs in prior solvers.
Proceeding s of the ACM on Programming Languages 2(POPL), 4 (2017)
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.