The trouble with for-loop invariants

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The trouble with for-loop invariants

Full text

Pdf (330 KB)

Source

Technical Symposium on Computer Science Education archive
Proceedings of the nineteenth SIGCSE technical symposium on Computer science education table of contents

Atlanta, Georgia, United States

Pages: 1 - 4

Year of Publication: 1988

ISBN:0-89791-256-X

Also published in ...

Author

William J. Collins

Radford Univ., Radford, VA

Sponsor

SIGCSE: ACM Special Interest Group on Computer Science Education

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 11, Downloads (12 Months): 42, Citation Count: 3

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/52964.52966 What is a DOI?

ABSTRACT

In this paper we discuss some of the problems in constructing and utilizing loop invariants for For-loops. Another kind of assertion, the loop post-invariant, is offered as an alternative to the loop invariant in designing, documenting and proving the correctness of For-loops.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	"Proving Programs Correct," Robert B. Anderson, John Wiley and Sons, 1979.
	2	"Intermediate Pascal Programming," William J. Collins, McGraw-Hill Book Company, 1986.
	3	David Gries, The Science of Programming, Springer-Verlag New York, Inc., Secaucus, NJ, 1987
	4	Paul Helman , Robert Veroff, Intermediate problem solving and data structures: walls and mirrors, Benjamin-Cummings Publishing Co., Inc., Redwood City, CA, 1986
	5	Robert R. Korfhage , Norman E. Gibbs, Principles of data structures and algorithms with Pascal, William C. Brown Publishers, Dubuque, IA, 1987

CITED BY 3

	Lisa M. Levy Kortright, From specific problem instances to algorithms in the introductory course, ACM SIGCSE Bulletin, v.26 n.1, p.71-75, March 1994
	David Larochelle , David Evans, Statically detecting likely buffer overflow vulnerabilities, Proceedings of the 10th conference on USENIX Security Symposium, p.14-14, August 13-17, 2001, Washington, D.C.
	David Larochelle , David Evans, Statically detecting likely buffer overflow vulnerabilities, Proceedings of the 10th conference on USENIX Security Symposium, p.14-14, August 13-17, 2001, Washington, D.C.