Research Commons
      • Browse 
        • Communities & Collections
        • Titles
        • Authors
        • By Issue Date
        • Subjects
        • Types
        • Series
      • Help 
        • About
        • Collection Policy
        • OA Mandate Guidelines
        • Guidelines FAQ
        • Contact Us
      • My Account 
        • Sign In
        • Register
      View Item 
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computing and Mathematical Sciences Papers
      • View Item
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computing and Mathematical Sciences Papers
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      An analysis of total correctness refinement models for partial relation semantics I

      Deutsch, Moshe; Henson, Martin C.; Reeves, Steve
      Thumbnail
      Files
      An analysis of total correctness refinement models for partial relation memantics 1.pdf
      435.3Kb
      DOI
       10.1093/jigpal/11.3.285
      Link
       jigpal.oxfordjournals.org
      Find in your library  
      Citation
      Export citation
      Deutsch, M., Henson, M.C. & Reeves, S. (2003). An analysis of total correctness refinement models for partial relation semantics I. The Logic Journal of the IGPL, 11(3), 285-316.
      Permanent Research Commons link: https://hdl.handle.net/10289/1469
      Abstract
      This is the first of a series of papers devoted to the thorough investigation of (total correctness) refinement based on an underlying partial relational model. In this paper we restrict attention to operation refinement. We explore four theories of refinement based on an underlying partial relation model for specifications, and we show that they are all equivalent. This, in particular, sheds some light on the relational completion operator (lifted-totalisation) due to Wookcock which underlines data refinement in, for example, the specification language Z. It further leads to two simple alternative models which are also equivalent to the others.
      Date
      2003
      Type
      Journal Article
      Publisher
      Oxford University Press
      Rights
      This article has been published in the journal: The Logic Journal of the IGPL. Copyright ©2003 Oxford University Press.
      Collections
      • Computing and Mathematical Sciences Papers [1454]
      Show full item record  

      Usage

      Downloads, last 12 months
      84
       
       
       

      Usage Statistics

      For this itemFor all of Research Commons

      The University of Waikato - Te Whare Wānanga o WaikatoFeedback and RequestsCopyright and Legal Statement