Some algorithms related to the Jacobian Conjecture

We describe an algorithm that computes possible corners of hypothetical counterexamples to the Jacobian Conjecture up to a given bound. Using this algorithm we compute the possible families corresponding to $gcd(deg(P),deg(Q))le 35$, and all the pairs $(deg(P),deg(Q))$ with $max(deg(P),deg(Q))le 150$ for any hypothetical counterexample.