This repository has been archived by the owner on Feb 12, 2022. It is now read-only.

Failure trace minimization #4

Open

dgryski opened this issue Jun 8, 2016 · 0 comments

dgryski commented Jun 8, 2016

Upon encountering an assertion failure, we have a list of transitions that is potentially very long including lots of extra noise. An algorithm such as ddmin ( https://www.st.cs.uni-saarland.de/papers/tse2002/tse2002.pdf , my implementation https://github.com/dgryski/go-ddmin) can effectively minimize the trace.

Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.