Derivation of a Path-Connectivity Matrix for Tagged Flowcharts

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Derivation of a Path-Connectivity Matrix for Tagged Flowcharts

Full text

Pdf (620 KB)

Source

Journal of the ACM (JACM) archive
Volume 22 , Issue 1 (January 1975) table of contents

Pages: 145 - 154

Year of Publication: 1975

ISSN:0004-5411

Author

Lawrence Yelowitz

Information and Computer Science Department, University of California, Irvine, CA and New Mexico Institute of Mining and Technology, Socorro, New Mexico

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 20, Citation Count: 0

Additional Information:

references 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/321864.321876 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	GOLDSTINE, I-I I-I., AND VON NEUMANN, J. Planning and coding of problems for an electronic computing instrument Reprinted m Collected Works of John yon Neumann, Vol 5, A H Traub, Ed., Pergamon Press, New York, 1961, pp. 80-235 (see especially p. 91).
	2	FLOYD, R W Assigning meamngs to programs In Proc of a Symposium in Apphed Mathematics, Vol 19, J T Schwartz, Ed , Amer Math Soc , Providence, R I , 1967, pp. 19-32.
	3	N.~va, P. Proof of algorithms by general snapshots. BIT 6 (1969), 310-316.
	4	MANNA, Z The correctness of programs J Comput Syst Sc7. 3 (1969), 119-127.
	5	Ralph L. London, Certification of algorithm 245 [M1]:treesort 3:proof of algorithms—a new kind of certification, Communications of the ACM, v.13 n.6, p.371-373, June 1970 [doi>10.1145/362384.362507]
	6	LONDON, R. L Expermnce with inductive assertions for proving programs correct. In Symposium on Semantics of Algor~thmm Languages, Lecture Notes on Mathematics, No 188, Springer-Verlag, Berlin, 1971, pp 235-251
	7	Johannes J. Martin, The 'natural' set of basic control structures, ACM SIGPLAN Notices, v.8 n.12, December 1973 [doi>10.1145/987006.987008]
	8	Corrado Böhm , Giuseppe Jacopini, Flow diagrams, turing machines and languages with only two formation rules, Communications of the ACM, v.9 n.5, p.366-371, May 1966 [doi>10.1145/355592.365646]
	9	Ole Johan Dahl, Structured Programming, Academic Press, Inc., Orlando, FL, 1972
	10	YELOWITZ, L. Toward optimal paginations for structured programs In Proc of a Symposium on Computers and Automata, Polytechmc Press, New York, 1971, pp. 225-236.
	11	Lawrence Yelowitz, A symmetric, top-down structured approach to computer program/proof development., 1972