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) . pp. 329-354. ISSN 0956-7968 [Article] (doi:10.1017/S0956796800001702)
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 Areas: | A. > School of Science and Technology > Computer Science A. > School of Science and Technology > Computer Science > Intelligent Environments group A. > School of Science and Technology > Computer Science > SensoLab group |
| Item ID: | 6357 |
| Useful Links: | |
| Depositing User: | Devika Mohan |
| Date Deposited: | 05 Aug 2010 07:15 |
| Last Modified: | 13 Oct 2016 14:20 |
| URI: | https://eprints.mdx.ac.uk/id/eprint/6357 |
Actions (login required)
 |
View Item |
Statistics
Additional statistics are available via IRStats2.
CORE (COnnecting REpositories)
CORE (COnnecting REpositories)