Carregant...
Speeding up Quantified Bit-Vector SMT Solvers by Bit-Width Reductions and Extensions
Recent experiments have shown that satisfiability of a quantified bit-vector formula coming from practical applications almost never changes after reducing all bit-widths in the formula to a small number of bits. This paper proposes a novel technique based on this observation. Roughly speaking, a gi...
Guardat en:
| Publicat a: | Theory and Applications of Satisfiability Testing – SAT 2020 |
|---|---|
| Autors principals: | , |
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
2020
|
| Matèries: | |
| Accés en línia: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7326550/ https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/978-3-030-51825-7_27 |
| Etiquetes: |
Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|