Using Formal Transformations to Construct a Component Repository (1991) [2 citations — 2 self]
|
Abstract:
This paper discusses how theoretical results from the eld of program transformations can be applied to develop a new approach to software reuse. We describe a model for the semantics of nondeterministic programs and specications and use this model to show how renements and transformations of programs and specications can be proved correct by reference to their corresponding Weakest Preconditions expressed as formulae in innitary rst order logic. We then show how this theory of program renements and transformations (which is further developed in [7]) can be applied to the construction of a repository of reusable components consisting of code, specications, documentation and development methods. These components are linked together in such a way that specications and their implementations can be extracted easily. 1
Citations
| 1169 | E.W.: A Discipline of Programming – Dijkstra - 1976 |
| 80 | Using and porting – Stallman - 1993 |
| 5 | Correctness Preserving Program Renements – Back - 1980 |
| 3 | iDerivation of a Sorting Algorithm,j – Ward - 1990 |
| 3 | iSpecications and Programs in a Wide Spectrum Language,j – Ward - 1991 |
| 2 | iProving Program Renements and Transformations,j – Ward - 1989 |
| 1 | iThe UNIX system and Software Reusability",j – Kernighan - 1984 |
| 1 | iThe Specication Statement,j Trans – Morgan - 1988 |
| 1 | iTransforming a Program into a Specication,j – Ward - 1988 |
