论文信息 - Data refinement and singleton failures refinement are not equivalent

Data refinement and singleton failures refinement are not equivalent

In this paper, we give simple example abstract data types, with atomic operations, that are related by data refinement under a definition used widely in the literature, but these same abstract data types are not related by singleton failure refinement. This contradicts results found in the literature.

Steve Reeves | David Streader

[1] Steve Dunne,et al. Process Refinement in B , 2005, ZB.

[2] John Derrick,et al. Refinement in Z and Object-Z , 2001 .

[3] Willem-Paul de Roever,et al. Data Refinement by Willem-Paul de Roever , 1998 .

[4] Steve Reeves,et al. Comparison of Data and Process Refinement , 2003, ICFEM.

[5] C. A. R. Hoare,et al. Data Refinement Refined , 1986, ESOP.

[6] Eerke Albert Boiten. REFINE 2002: The BCS FACS Refinement Workshop , 2002 .

[7] Jim Davies,et al. A singleton failures semantics for Communicating Sequential Processes , 2006, Formal Aspects of Computing.

[8] Jim Davies,et al. A comparison of refinement orderings and their associated simulation rules , 2002, Refine.

[9] Eerke A. Boiten,et al. Unifying concurrent and relational refinement , 2002, Electron. Notes Theor. Comput. Sci..

[10] Kai Engelhardt,et al. Data Refinement: Model-Oriented Proof Methods and their Comparison , 1998 .

[11] Eerke Albert Boiten,et al. Refinement in Z and Object-Z: Foundations and Advanced Applications , 2001 .

[12] Willem-Paul de Roever,et al. Data Refinement: Theory , 1998 .

[13] Andrew William Roscoe,et al. The Theory and Practice of Concurrency , 1997 .

[14] Jim Woodcock,et al. Using Z - specification, refinement, and proof , 1996, Prentice Hall international series in computer science.

[15] Eerke A. Boiten,et al. Relational Concurrent Refinement , 2003, Formal Aspects of Computing.