TO
Filters: Department: "Kahlert School of Computing" Collection: "ir_uspace" Subject: "Partial order reduction algorithms"
1 - 25 of 2
| Creator | Title | Description | Subject | Date | ||
|---|---|---|---|---|---|---|
| 1 |
 | Gopalakrishnan, Ganesh | A symbolic partial order reduction algorithm for rule based transition systems | Partial order reductions are a class of methods that attempt to reduce the state space that must be explored to verify systems by explicit state enumeration. Partial order reduction algorithms have been successfully incorporated into tools such as Spin and VFSM-valid. However, current partial ord... | Partial order reductions; Partial order reduction algorithms; SAT solver; Rule based transition systems | 2003-12-01 |
| 2 |
 | 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 |
1 - 25 of 2