A carregar...
Reducing Bit-Vector Polynomials to SAT Using Gröbner Bases
We address the satisfiability of systems of polynomial equations over bit-vectors. Instead of conventional bit-blasting, we exploit word-level inference to translate these systems into non-linear pseudo-boolean constraints. We derive the pseudo-booleans by simulating bit assignments through the addi...
Na minha lista:
| Publicado no: | Theory and Applications of Satisfiability Testing – SAT 2020 |
|---|---|
| Main Authors: | , , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
2020
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7326557/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-51825-7_26 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|