Partsch, H.A. and Boiten, E.A. (1991) A Note on Similarity of Specifications and Reusability of Transformational Developments. In: UNSPECIFIED.
|The full text of this publication is not available from this repository. (Contact us about this Publication)|
This paper explores the possibilities of reuse of transformational developments. Although it has often been claimed that this could be done fully mechanically, the experience with a number of derivations in this chapter indicates that this claim is somewhat preposterous. Only by describing the transformation steps in a very abstract way (using just natural language) and by considering very general specifications, can the developments be reused. The central concept is similarity, and several definitions of this informal notion are given, each leading to a particular kind of reuse of derivations. Variants of a derivation of linear search lead to several interesting search algorithms, culminating in derivations by reuse of two complicated string matching algorithms.
|Item Type:||Conference or workshop item (UNSPECIFIED)|
|Uncontrolled keywords:||transformational programming, pattern matching, reuse|
|Subjects:||Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,|
|Divisions:||Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Faculties > Science Technology and Medical Studies > School of Computing > Systems Architecture Group
|Depositing User:||Mark Wheadon|
|Date Deposited:||03 Aug 2009 17:51|
|Last Modified:||24 Apr 2012 14:12|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/21003 (The current URI for this page, for reference purposes)|
- Depositors only (login required):