By Topic

The use of functional annotations in verifying imperative programs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Nicholl, R. ; Western Ontario Univ., London, Ont., Canada ; Clint, M. ; Gray, D. ; Nicholl, T.

Functional programming languages have been advocated as a means for writing more reliable programs, although imperative programming languages permit more efficient execution on conventional computer hardware. The authors advocate a means of using a functional notation to annotate imperative programs and present a method for verifying that the annotated sections of code achieve the results specified in the annotation. Examples are given to show how the method is used. These demonstrate that this approach to program correctness leads to verification conditions which are briefer, but more numerous, than those which result from verifying more conventionally annotated programs. A goal of the article is to provide a technique to facilitate the activity of operational decomposition in a formal method in which refinements of specifications to implementations are made

Published in:

Software Engineering Journal  (Volume:5 ,  Issue: 5 )