A new algorithm for "backward execution" in AND-parallel logic programs is described, and new implementation techniques for this class of algorithm are introduced. The dataflow graph that determines forward and backward execution orders, the status of subgoals, and other state information in an AND process are represented by bitsets, and the steps of the algorithm are efficient operations on bitsets. Data from simulations show the implementation techniques are effective, and form the basis of several interesting future experiments.