Feb 12, 2018 · A new approach, called Quasi-Optimal POR, that can arbitrarily approximate an optimal exploration using a provided constant k.

A dynamic partial order reduction (DPOR) algorithm is optimal when it always explores at most one representative per Mazurkiewicz trace.

Abstract. A dynamic partial order reduction (DPOR) algorithm is op- timal when it always explores at most one representative per Mazurkie- wicz trace.

Jul 18, 2018 · A dynamic partial order reduction (DPOR) algorithm is optimal when it always explores at most one representative per Mazurkiewicz trace.

A new approach, called Quasi-Optimal POR, that can arbitrarily approximate an optimal exploration using a provided constant k is presented, ...

Jul 14, 2018 · A dynamic partial order reduction (DPOR) algorithm is optimal when it always explores at most one representative per Mazurkiewicz trace.

Our main contribution is a new approach, called Quasi-Optimal POR, that can arbitrarily approximate an optimal exploration using a provided constant k. We ...

Our main contribution is a new approach, called Quasi-Optimal POR, that can arbitrarily approximate an optimal exploration using a provided constant k. We ...

We combine Quasi-Optimal Partial-Order Reduction, a state-of-the-art technique that tackles path explosion due to interleaving non-determinism, with symbolic ...

Quasi-Optimal Partial Order Reduction · List of references · Publications that cite this publication.