Partial order (PO) reduction methods are widely employed to combat state explosion during model-checking. We develop a partial order reduction algorithm for rule-based languages such as Murphi [4] based on the observation that for finite-state systems, independence conditions used for PO reduction can be encoded as boolean propositions and checked using SAT methods. Comparisons against static-a...

Abstract Let N be a zero-symmetric (right) nearring with identity. We introduce partial order in the matrix corresponding to (defined by Pilz Near-rings: theory and its applications, North Holland, Amsterdam, 1983) . A positive cone is defined characterization theorem obtained. For convex ideal I , we prove that $${I^*}$$ <mml...

Abstract Existing dynamic partial order reduction (DPOR) algorithms scale poorly on concurrent data structure benchmarks because they visit a huge number of blocked executions due to spinloops. In response, we develop Awamoche , sound, complete, and strongly optimal DPOR algorithm that avoids exploring any useless in programs with await confirmation-CAS loops. Consequently, it outperforms the s...