A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
Exploiting predicate structure for efficient reachability detection
2005
Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering - ASE '05
Partial order (p.o.) reduction techniques are a popular and effective approach for tackling state space explosion in the verification of concurrent systems. These techniques generate a reduced search space that could be exponentially smaller than the complete state space. Their major drawback is that the amount of reduction achieved is highly sensitive to the properties being verified. For the same program, different properties could result in very different amounts of reduction achieved. We
doi:10.1145/1101908.1101913
dblp:conf/kbse/KashyapG05
fatcat:avuic6u45bfenhqsqjxispdfuu