A Weaker Precondition for Loops

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A Weaker Precondition for Loops

Full text

Pdf (528 KB)

Source

ACM Transactions on Programming Languages and Systems (TOPLAS) archive
Volume 4 , Issue 4 (October 1982) table of contents

Pages: 668 - 677

Year of Publication: 1982

ISSN:0164-0925

Author

H. J. Boom

Computer Science Department, Concordia University, 1455 de Maisonneuve Boulevard West, Montreal, P.Q., Canada H3G 1M8

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 29, Citation Count: 6

Additional Information:

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/69622.357189 What is a DOI?

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	BooM, H.J. Task reduction systems. Rep. IW 95/78, Mathematical Centre, Amsterdam, 1978.
	2	Nachum Dershowitz , Zohar Manna, Proving termination with multiset orderings, Communications of the ACM, v.22 n.8, p.465-476, Aug. 1979 [doi>10.1145/359138.359142]
	3	Edsger Wybe Dijkstra, A Discipline of Programming, Prentice Hall PTR, Upper Saddle River, NJ, 1997
	4	David Gries, Is Sometimes Ever Better Than Always?, ACM Transactions on Programming Languages and Systems (TOPLAS), v.1 n.2, p.258-265, Oct. 1979 [doi>10.1145/357073.357080]
	5	Zohar Manna , Richard Waldinger, Is “sometime” sometimes better than “always”?: intermittent assertions in proving program correctness, Communications of the ACM, v.21 n.2, p.159-172, Feb. 1978 [doi>10.1145/359340.359353]
	6	TROELSTRA, A.S. Choice Sequences. Oxford University Press, New York, 1977.

CITED BY 6

	Manfred Broy , Greg Nelson, Adding fair choice to Dijkstra's calculus, ACM Transactions on Programming Languages and Systems (TOPLAS), v.16 n.3, p.924-938, May 1994
	David Harel, A general result on infinite trees and its applications, Proceedings of the sixteenth annual ACM symposium on Theory of computing, p.418-427, December 1984
	Ernst-Rüdiger Olderog , Krzysztof R. Apt, Fairness in parallel programs: the transformational approach, ACM Transactions on Programming Languages and Systems (TOPLAS), v.10 n.3, p.420-455, July 1988
	K. R. Apt , G. D. Plotkin, Countable nondeterminism and random assignment, Journal of the ACM (JACM), v.33 n.4, p.724-767, Oct. 1986
	David Harel, Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness, Journal of the ACM (JACM), v.33 n.1, p.224-248, Jan. 1986
	Joseph M. Morris , Alexander Bunkenburg , Malcolm Tyrrell, Term transformers: A new approach to state, ACM Transactions on Programming Languages and Systems (TOPLAS), v.31 n.4, p.1-42, May 2009