Reducing Bit-Vector Polynomials to SAT Using Gröbner Bases

Thomas Seed, Andy King, Neil Evans. Reducing Bit-Vector Polynomials to SAT Using Gröbner Bases. In Luca Pulina, Martina Seidl, editors, Theory and Applications of Satisfiability Testing - SAT 2020 - 23rd International Conference, Alghero, Italy, July 3-10, 2020, Proceedings. Volume 12178 of Lecture Notes in Computer Science, pages 361-377, Springer, 2020. [doi]

Authors

Thomas Seed

This author has not been identified. Look up 'Thomas Seed' in Google

Andy King

This author has not been identified. Look up 'Andy King' in Google

Neil Evans

This author has not been identified. Look up 'Neil Evans' in Google