Name
Abstract | ||
|---|---|---|
This paper presents a behavioural semantics for abstract data types, and thus a correspondence between data types and processes. The value of this correspondence lies in the fact that simulation of the abstract data types is easily verified, and is equivalent to failures refinement of the corresponding processes. The method of constructing a semantics, and the method of proving equivalence between notions of refinement, are independent of the cho- sen interpretation. The same methods can be used to establish other correspondences between state-based and behavioural descriptions. |
Year | Venue | Keywords |
|---|---|---|
1999 | IFM | data types |
Field | DocType | ISBN |
Abstract data type,Programming language,Computer science,Theoretical computer science,Data type,Semantics | Conference | 1-85233-107-0 |
Citations | PageRank | References |
36 | 1.85 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christie Bolton | 1 | 132 | 9.27 |
| Jim Davies | 2 | 673 | 80.95 |
| Jim Woodcock | 3 | 534 | 77.08 |