Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I am looking for benchmarks in the UFBV category. This category is not yet directly represented in the SMT competition.
Sure, most of the (A)UFLIA benchmarks can be easily changed to UFBV benchmarks, by changing uninterpreted sorts to bitvector sorts and integer arithmetic to bitvector arithmetic. A script for automating this will be also helpful for me.
Regards,
Aboubakr Achraf El Ghazi
You can download the UFBV (and BV) benchmarks used in the paper “Efficiently solving quantified bit-vector formulas” at:
BTW, these benchmarks have been submitted to SMT-LIB. So, they will eventually be available in the SMT-LIB website.