Equivalence Class Based Parity Reasoning with DPLL(XOR)

Abstract

The recently introduced DPLL (XOR) framework for deciding satisfiability of propositional formulas with parity constraints is studied. A new parity reasoning module, based on equivalence class manipulation, is developed and implementation techniques for it described. It is shown that the deduction power of the new module is equivalent to another one proposed earlier. Additional reasoning module independent techniques are presented. Different design choices and module integration strategies are experimentally evaluated on three stream ciphers Trivium, Grain, and Hitag2. The new approach achieves major runtime speedups on the Trivium cipher and significant reduction in the number of decisions on Grain and Hitag2 ciphers.