| 摘要 |
A computer implemented testing framework for symbolic trace analysis of observed concurrent traces that uses MAT-based reduction to obtain succinct encoding of concurrency constraints, resulting in quadratic formulation in terms of number of transitions. We also present encoding of various violation conditions. Especially, for data races and deadlocks, we present techniques to infer and encode the respective conditions. Our experimental results show the efficacy of such encoding compared to previous encoding using cubic formulation. We provided proof of correctness of our symbolic encoding. |
