The SymPy library does implement this. As of 6.2.0, GNU Multiple Precision Arithmetic Library's mpz_probab_prime_p function uses a strong Lucas test and a Miller-Rabin test; previous versions did not make use of Baillie-PSW. Magma's IsProbablePrime and IsProbablyPrime functions use 20 Miller-Rabin tests for numbers > 34·1013, but do not combine them with a Lucas probable prime test. Cryptographic libraries often have prime-testing functions. Albrecht et al. discuss the tests used in these libraries. Some use a combined Fermat and Lucas test; many do not. For some of the latter, Albrecht, et al. were able to construct composite numbers that the libraries declared to be prime.