Now showing items 6-10 of 75

  • Comparison of data and process refinement

    Reeves, Steve; Streader, David (University of Waikato, Department of Computer Science, 2003-05)
    When 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 ...
  • Composing patterns to construct secure systems

    Rimba, Paul; Zhu, Liming; Bass, Len; Kuz, Ihor; Reeves, Steve (IEEE, 2015)
    Building secure applications requires significant expertise. Secure platforms and security patterns have been proposed to alleviate this problem. However, correctly applying patterns to use platform features is still highly ...
  • Considering reachability when comparing data refinements

    Reeves, Steve (University of Waikato, Department of Computer Science, 2008-11-03)
    Adding considerations about reachability to the Logics of Specification Languages [1] chapter [2].
  • Constructing programs or processes

    Reeves, Steve; Streader, David (Institute for Information Processing and Computer Supported New Media, 2005-12-28)
    We define interacting sequential programs, motivated originally by constructivist considerations. We use them to investigate notions of implementation and determinism. Process algebras do not define what can be implemented ...
  • Constructing programs or processes

    Reeves, Steve; Streader, David (Department of Computer Science, University of Waikato, 2005-12)
    We define interacting sequential programs, motivated originally by constructivist considerations. We use them to investigate notions of implementation and determinism. Process algebras do not define what can be implemented ...