Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
1984 | 10.1007/3-540-12925-1_35 | Symposium on Programming |
Keywords | Field | DocType |
restricted enumerations,partial order | Discrete mathematics,Notation,Correctness proofs,Algebra,Concurrency,Enumeration,Correctness,Semantic relation,Formalism (philosophy),Mathematics,Partially ordered set | Conference |
Volume | ISSN | ISBN |
167 | 0302-9743 | 3-540-12925-1 |
Citations | PageRank | References |
1 | 0.37 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stephan Heilbrunner | 1 | 63 | 8.28 |
| Lothar Schmitz | 2 | 9 | 4.34 |