Satisfiability Modulo Exponential Integer Arithmetic
Published in Lecture Notes in Computer Science • Jan 1, 2024
NobleIDNI9P97W23R00S96
Authors:,
Florian Frohn
Jürgen Giesl
Abstract
Abstract SMT solvers use sophisticated techniques for polynomial (linear or non-linear) integer arithmetic. In contrast, non-polynomial integer arithmetic has mostly been neglected so far. However, in the context of program verification, polynomials are often insufficient to capture the behavior of ...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!