English

lazybvtoint at the SMT Competition 2020

Logic in Computer Science 2021-05-21 v1

Abstract

lazybvtoint is a new prototype SMT-solver, that will participate in the incremental and non-incremental tracks of the \qfbv logic.

Keywords

Cite

@article{arxiv.2105.09743,
  title  = {lazybvtoint at the SMT Competition 2020},
  author = {Yoni Zohar and Ahmed Irfan and Makai Mann and Andres Notzli and Andrew Reynolds and Clark Barrett},
  journal= {arXiv preprint arXiv:2105.09743},
  year   = {2021}
}