Show simple item record  

dc.contributor.authorReeves, Steve
dc.contributor.authorStreader, David
dc.date.accessioned2008-10-09T01:38:34Z
dc.date.available2008-10-09T01:38:34Z
dc.date.issued2003-05
dc.identifier.citationReeves, S. & Streader, D. (2003). Comparison of data and process refinement. (Working paper 05/03). Hamilton, New Zealand: University of Waikato, Department of Computer Science.en_US
dc.identifier.issn1170-487X
dc.identifier.urihttps://hdl.handle.net/10289/1007
dc.description.abstractWhen is it reasonable, or possible, to refine a one place buffer into a two place buffer? In order to answer this question we characterise refinement based on substitution in restricted contexts. We see that data refinement (specifically in Z) and process refinement give differing answers to the original question, and we compare the precise circumstances which give rise to this difference by translating programs and processes into labelled transition systems, so providing a common basis upon which to make the comparison. We also look at the closely related area of subtyping of objects. Along the way we see how all these sorts of computational construct are related as far as refinement is concerned, discover and characterise some (as far as we can tell) new sorts of refinement and, finally, point up some research avenues for the future.en_US
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.publisherUniversity of Waikato, Department of Computer Scienceen_US
dc.relation.ispartofseriesComputer Science Working Papers
dc.subjectcomputer scienceen_US
dc.subjectdata refinementen_US
dc.subjectprocess refinementen_US
dc.subjectlabelled transition systemsen_US
dc.subjectZen_US
dc.subjectsubtypingen_US
dc.subjecttheoretical paperen_US
dc.titleComparison of data and process refinementen_US
dc.typeWorking Paperen_US
uow.relation.series05/03


Files in this item

This item appears in the following Collection(s)

Show simple item record