Verifying Interrupt-driven Programs Efficiently via Heuristic and Reduced Partial-order Constraints
A model checking approach for detecting assertion violations in interrupt-driven programs by considering the unique enable-before mechanism specific to interrupt-driven programs, infeasible partial-order constraints are identified and eliminated, resulting in a simplified formula for more efficient reasoning.