Skip Navigation

The Computer Journal 1984 27(3):230-232; doi:10.1093/comjnl/27.3.230
© 1984 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (5)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Lew, A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Proof of Correctness of Decision Table Programs

A. Lew *

Department of Information and Computer Sciences, University of Hawaii at Manoa, Honolulu, USA

Proof methods adequate for computer programs expressed in a wide range of languages are well developed. One program construct, however, has been neglected—namely, that of decision tables. It is shown here how decision table programs can be proved correct. The use of their level structure and the treatment of ‘impossible’ rules are of special significance. The method is illustrated by a proof of a bubble sort algorithm.

Received May 1983.

* Permanent address: Department of Information and Computer Sciences, University of Hawaii at Manoa, Honolulu, Hawaii 96822, USA.

§ Oxford University Computing Laboratory, Programming Research Group, Oxford OX1 3QD, UK


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.