Abstract
A methodology of program development bytransformations is outlined. In particular, ways of representing the transformation rules are discussed, and the relationship between notions of their correctness and the semantic definition of programming languages is studied. How transformation techniques are complemented by the use of abstract data types and assertions is described. In the resulting calculus of transformations, the single rules not only represent design or optimization techniques, but they also incorporate verification principles. To illustrate this approach, the Warshall algorithm is developed by successive applications of transformations.
Original language | English |
---|---|
Pages (from-to) | 14-22 |
Number of pages | 9 |
Journal | IEEE Transactions on Software Engineering |
Volume | SE-7 |
Issue number | 1 |
DOIs | |
State | Published - Jan 1981 |
Keywords
- Abstract data types
- correctness of transformation rules
- program transformations
- transformational semantics