@MISC{Wang_onthe, author = {Bow-yaw Wang}, title = {On the Satisfiability of Modular Arithmetic Formulae}, year = {} }

Share

OpenURL

Abstract

Abstract. Modular arithmetic is the underlying integral computation model in conventional programming languages. In this paper, we discuss the satisfiability problem of propositional formulae in modular arithmetic can be obtained by solving alternation-free Presburger arithmetic, it is easy to see that the problem is in fact NP-complete. Further, we give an efficient reduction to integer programming with the number of constraints and variables linear in the length of the given linear modular arithmetic formula. For non-linear modular arithmetic formulae, an additional factor of ω is needed. With the advent of efficient integer programming packages, our algorithm could be useful to software verification in practice. over the finite ring Z2 ω. Although an upper bound of 22O(n4) 1