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.

      Results on formal stepwise design in Z

      Deutsch, Moshe; Henson, Martin C.; Reeves, Steve
      Thumbnail
      Files
      content.pdf
      301.5Kb
      DOI
       10.1109/APSEC.2002.1182973
      Link
       doi.ieeecomputersociety.org
      Find in your library  
      Citation
      Export citation
      Deutsch, M., Henson, M.C. & Reeves, S. (2002). Results on formal stepwise design in Z. In Proceedings: APSEC 2002: Ninth Asia-Pacific Software Engineering Conference: 4-5 December, 2002, Gold Coast, Australia. (pp. 33-42). Los Alamitos, Calif.: IEEE Computer Society Press.
      Permanent Research Commons link: https://hdl.handle.net/10289/86
      Abstract
      Stepwise design involves the process of deriving a concrete model of a software system from a given abstract one. This process is sometimes known as refinement. There are numerous refinement theories proposed in the literature, each of which stipulates the nature of the relationship between an abstract specification and its concrete counterpart. This paper considers six refinement theories in Z that have been proposed by various people over the years. However, no systematic investigation of these theories, or results on the relationships between them, have been presented or published before. This paper shows that these theories fall into two important categories and proves that the theories in each category are equivalent.
      Date
      2002-12-01
      Type
      Conference Contribution
      Publisher
      IEEE Computer Society
      Rights
      ©2000 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
      Collections
      • Computing and Mathematical Sciences Papers [1454]
      Show full item record  

      Usage

      Downloads, last 12 months
      78
       
       
       

      Usage Statistics

      For this itemFor all of Research Commons

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