Abstract / Description of output
A simulation relation between programs is defined which is quasi-ordering. Mutual simulation is then an equivalence relation, and by dividing out by it we abstract from a program such details as how the sequencing is controlled and how data is represented. The equivalence classes are approxiamtions to the algorithms which are realized, or expressed, by their member programs. A technique is given and illustrated for proving simulation and equivalence of programs; there is an analogy with Floyd''s technique for proving correctness of programs. Finally, necessary and sufficient conditions for simulation are given.
| Original language | English |
|---|---|
| Title of host publication | IJCAI |
| Subtitle of host publication | Proceedings of the 2nd International Joint Conference on Artificial Intelligence. London, UK, September 1971 |
| Editors | D. C. Cooper |
| Publisher | William Kaufmann Inc. |
| Pages | 481-489 |
| Number of pages | 9 |
| Publication status | Published - 1971 |
Keywords / Materials (for Non-textual outputs)
- dblp