| O. Strichman. On solving Presburger and linear arithmetic with SAT. In M.D. Aagaard and J.W. O'Leary, editors, Formal Methods in Computer-Aided Design (FMCAD), LNCS 2517, pages 160--170, 2002. |
....second order variables can be eliminated. More optimal versions can be found in [15, 20, 11] Recently, this method is applied in [24] to boolean combinations over successor, predecessor, equality and inequality over the integers, in [28] it is applied to separation predicates x y c, and in [27], Pressburger arithmetic for integers, and linear arithmetic for reals are translated into propositional logic. In the last approach that we mention, called the EQ BDD method (Binary Decision Diagrams extended with Equality [16] boolean and arithmetic reasoning are not separated, but ....
O. Strichman. On solving Presburger and linear arithmetic with SAT. In M.D. Aagaard and J.W. O'Leary, editors, Formal Methods in Computer-Aided Design (FMCAD), LNCS 2517, pages 160--170, 2002.
....which second order variables can be eliminated. More optimal versions can be found in [15, 20, 11] Recently, this method is applied in [24] to boolean combinations over successor, predecessor, equality and inequality over the integers, in [28] it is applied to separation predicates x y c, and in [27], Pressburger arithmetic for integers, and linear arithmetic for reals are translated into propositional logic. In the last approach that we mention, called the EQ BDD method (Binary Decision Diagrams extended with Equality [16] boolean and arithmetic reasoning are not separated, but ....
O. Strichman. On solving Presburger and linear arithmetic with SAT. In M.D. Aagaard and J.W. O'Leary, editors, Formal Methods in Computer-Aided Design (FMCAD), LNCS 2517, pages 160--170, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC