We present a satissability test and a probabilistic nonequivalence test for syntactic (1; +k)-branching programs. The satissability test works in time at most O(? 4en k k sd), where s and d are the size and depth of the input branching program. The probabilistic nonequivalence test works in time O(? 12en k k sd log 2 n). The result has consequences also for parity syntactic (1; +k)-branching programs.