Dynamic partial order reduction (DPOR) verifies concurrent programs by exploring all their interleavings up to some equivalence relation, such as the Mazurkiewicz trace equivalence. Doing so involves a complex trade-off between space and time. Existing DPOR algorithms are either exploration-optimal (i.e., explore exactly only interleaving per class) but may use exponential memory in size of pro...

The Landau-Lifshitz equation is the first in an infinite series of approximations to Lorentz-Abraham-Dirac obtained from `reduction order'. We show that this divergent, predicting wildly different dynamics at successive perturbative orders. Iterating reduction order ad infinitum a constant crossed field, we obtain motion which free erratic behaviour perturbation theory. Borel-Pad\'e resummation...