论文信息 - For Statements with Restricted Enumerations

For Statements with Restricted Enumerations

We describe a notation for specifying for-loops which enumerate the elements of a set according to a partial ordering. This serves to separate implementation and efficiency issues from correctness issues. In order to demonstrate its usefulness we apply our notation to three completely different problems and give correctness proofs. Also, we show that our for-loops nicely combine with a formalism for specifying concurrency.

Lothar Schmitz | Stephan Heilbrunner

[1] Christian Lengauer,et al. A Methodology for Programming with Concurrency: An Informal Presentation , 1982, Sci. Comput. Program..

[2] Christian Lengauer. A Methodology for Programming with Concurrency: The Formalism , 1982, Sci. Comput. Program..

[3] Mary Shaw,et al. Abstraction and verification in Alphard: Defining and specifying iteration and generators , 1977 .

[4] Narain H. Gehani,et al. Some ideas on data types in high-level languages , 1976, CACM.

[5] Craig Schaffert,et al. Abstraction mechanisms in CLU , 1977, Commun. ACM.

[6] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[7] A. J. M. van Gasteren,et al. An Introduction to Three Algorithms for Sorting in Situ , 1982, Inf. Process. Lett..

[8] Charles Antony Richard Hoare,et al. A note on the for statement , 1972 .

[9] King-Sun Fu,et al. VLSI architectures for high speed recognition of context-free languages and finite-state languages , 1982, ISCA 1982.

[10] Edsger W. Dijkstra,et al. A Discipline of Programming , 1976 .

[11] Michael A. Harrison,et al. Introduction to formal language theory , 1978 .