WebAssembly programs are translated to constrained Horn clauses so existing solvers can prove or disprove the reachability of crash instructions.
Title resolution pending
1 Pith paper cite this work, alongside 28 external citations. Polarity classification is still indexing.
1
Pith paper citing it
28
external citations · OpenAlex
fields
cs.PL 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
CHC-based Automated Verification of WebAssembly Programs
WebAssembly programs are translated to constrained Horn clauses so existing solvers can prove or disprove the reachability of crash instructions.