TO
1 - 25 of 3
| Creator | Title | Description | Subject | Date | ||
|---|---|---|---|---|---|---|
| 1 |
 | Subrahmanyam, P.A. | On proving the correctness of data type implementations | In order to prove the correctness (or consistency) of an implementation of a data type with respect to the data type's specifications, the minimal amount of information that needs to be provided consists of: (i) a specification of the type being implemented; (ii) a specification of the representati... | Data type; Consistency | 1980 |
| 2 |
 | Gopalakrishnan, Ganesh | On the decidability of shared memory consistency verification | We view shared memories as structures which define relations over the set of programs and their executions. An implementation is modeled by a transducer, where the relation it realizes is its language. This approach allows us to cast shared memory verification as language inclusion. We show tha... | Shared memory; Consistency; Verification | 2005-03-15 |
| 3 |
 | Henderson, Thomas C. | Parallel path consistency | Filtering algorithms are well accepted as a means of speeding up the solution of the consistent labeling problem (CLP). Despite the fact that path consistency does a better job of filtering than arc consistency, AC is still the preferred technique because it has a much lower time complexity. We ar... | Filtering algorithms; Parallel paths; Consistency; Consistent labeling problem; CLP | 1991 |
1 - 25 of 3