Library Open Repository

Is disciplined programming transferable, and is it insightful?

Downloads

Downloads per month over past year

Lakos, C and Sale, AHJ (1978) Is disciplined programming transferable, and is it insightful? Australian Computer Journal, 10 (3). pp. 87-97.

[img]
Preview
PDF (page images)
Disciplined.pdf | Download (4MB)
Available under University of Tasmania Standard License.

Abstract

This paper examines the disciplined programming methodology of EM Dijkstra which advocates the development of correctness proofs simultaneously with writing a program, (if not before) in the context of two problems which faced the authors recently. The paper applies the thought processes advocated by Dijkstra to these problems and indicates the insights that the authors gained from this. In both cases algorithms new to the authors were derived, and the properties of these are also examined. The paper should be interesting to those concerned with increasing the effectiveness of programming, for it demonstrates that the techniques advocated by Dijkstra are indeed transferable to other programmers, and that this transfer yields better insight into the activity we call programming.

Item Type: Article
Keywords: discplined programming, programming methodology, tree traversal, algorithm analysis, correctness proofs, text searching
Journal or Publication Title: Australian Computer Journal
Publisher: Australian Computer Society Inc
Page Range: pp. 87-97
Date Deposited: 04 Jan 2005
Last Modified: 18 Nov 2014 03:10
URI: http://eprints.utas.edu.au/id/eprint/129
Item Statistics: View statistics for this item

Repository Staff Only (login required)

Item Control Page Item Control Page