Creator | Title | Description | Subject | Date | ||
---|---|---|---|---|---|---|
1 |
![]() | Gopalakrishnan, Ganesh | Partial order reduction without the proviso | In this paper, we present a new partial order reduction algorithm that can help reduce both space and time requirements of on-the-fly explicit enumeration based verifiers. The partial order reduction algorithms described in [God95, HP94, Pel94, Pel96] were observed to yield very little savings in ma... | Partial order reduction algorithms | 1996 |