Cargando…
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...
Autores principales: | Jonáš, Martin, Strejček, Jan |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7326550/ http://dx.doi.org/10.1007/978-3-030-51825-7_27 |
Ejemplares similares
-
MachSMT: A Machine Learning-based Algorithm Selector for SMT Solvers
por: Scott, Joseph, et al.
Publicado: (2021) -
BitMapper: an efficient all-mapper based on bit-vector computing
por: Cheng, Haoyu, et al.
Publicado: (2015) -
Automated and Sound Synthesis of Lyapunov Functions with SMT Solvers
por: Ahmed, Daniele, et al.
Publicado: (2020) -
Bit by Bit: The Darwinian Basis of Life
por: Joyce, Gerald F.
Publicado: (2012) -
It from Bit or Bit from It?: on physics and information
por: Aguirre, Anthony, et al.
Publicado: (2015)