1 citations · 1 across the 7 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.LO2024
PolySAT: Word-level Bit-vector Reasoning in Z3
Jakob Rath, Clemens Eisenhofer, Daniela Kaufmann +2
PolySAT is a word-level decision procedure supporting bit-precise SMT reasoning over polynomial arithmetic with large bit-vector operations. The PolySAT calculus extends conflict-d…
cs.LO2024
Spanning Matrices via Satisfiability Solving
Clemens Eisenhofer, Michael Rawson, Laura Kovács
We propose a new encoding of the first-order connection method as a Boolean satisfiability problem. The encoding eschews tree-like presentations of the connection method in favour…