A Fresh Look at Best Inductive Loop Invariant Synthesis for Bit-Vector Relations
This work presents two new algorithms for bit-vector programs: a strategically guided linear search that exploits the lattice structure and a bitwise greedy approach that resolves bound bits from high to low with a solver-call count linear in bit-width.