Formal basis for the refinement of rule based transition systems

CLARK, Tony (1996). Formal basis for the refinement of rule based transition systems. Journal of Functional Programming, 6 (2), 329-354.

Full text not available from this repository.
Official URL: http://journals.cambridge.org/action/displayFullte...
Link to published version:: https://doi.org/10.1017/S0956796800001702
Related URLs:

    Abstract

    This paper makes a contribution to the refinement of systems which involve search by proposing a simple non-deterministic model for rule based transition systems and using this to define a meaning for rule based refinement which allows each stage of the software development path to be verified with respect to the previous stage. The proposal allows a system which involves search to be specified in terms of all the possible outcomes. Each stage of refinement will introduce complexity to the rules and therefore develop the search space in ever more sophisticated ways. At each stage of the refinement it will be possible to be precise about which collections of outcomes have been deleted, thereby achieving a verified (prototype) implementation.

    Item Type: Article
    Research Institute, Centre or Group - Does NOT include content added after October 2018: Cultural Communication and Computing Research Institute > Communication and Computing Research Centre
    Departments - Does NOT include content added after October 2018: Faculty of Science, Technology and Arts > Department of Computing
    Identification Number: https://doi.org/10.1017/S0956796800001702
    Page Range: 329-354
    Depositing User: Tony Clark
    Date Deposited: 20 Apr 2016 08:51
    Last Modified: 13 Jun 2017 13:34
    URI: http://shura.shu.ac.uk/id/eprint/12000

    Actions (login required)

    View Item View Item

    Downloads

    Downloads per month over past year

    View more statistics