Bowman, H. and Boiten, E.A. and Derrick, J. and Steen, M.W.A. (1999) Strategies for consistency checking based on unification. Science of Computer Programming, 33 (3). pp. 261-298. ISSN 0167-6423.
| The full text of this publication is not available from this repository. (Contact us about this Publication) | |
| Official URL http://dx.doi.org/10.1016/S0167-6423(98)00017-3 |
Abstract
There is increasing interest in models of system development which use Multiple Viewpoints. Each viewpoint offers a different perspective on the target system and system development involves parallel refinement of the multiple views. Multiple viewpoints though, prompt the issue of consistency between viewpoints. This paper describes an interpretation of consistency which is general enough to meet the requirements of consistency for very general viewpoints models. Furthermore, the paper investigates strategies for checking this consistency definition. Particular emphasis is placed on mechanisms to obtain global consistency (between an arbitrary number of viewpoints) from a series of binary consistency checks. The consistency checking strategies we develop are illustrated using the formal description technique LOTOS.
| Item Type: | Article |
|---|---|
| Uncontrolled keywords: | Viewpoints; Consistency; Formal description techniques; LOTOS |
| Subjects: | Q Science Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Divisions: | Faculties > Science Technology and Medical Studies > School of Computing > Systems Architecture Group Faculties > Science Technology and Medical Studies > School of Computing Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group |
| Depositing User: | M. Nasiriavanaki |
| Date Deposited: | 08 Jul 2009 07:47 |
| Last Modified: | 16 Oct 2009 13:29 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/17119 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
