Podrobná bibliografie
| Název: |
Program equivalence checking by two-tape automata. |
| Autoři: |
Zakharov, V. A. |
| Zdroj: |
Cybernetics & Systems Analysis; Jul2010, Vol. 46 Issue 4, p554-562, 9p |
| Témata: |
SEQUENTIAL processing (Computer science), DECISION logic tables, PROGRAMMING language semantics, AUTOMATION, ACYCLIC model, COMPUTATIONAL complexity |
| Abstrakt: |
This paper shows how two-tape automata can be employed to design efficient equivalence checking procedures for sequential programs. The semantics of sequential programs is defined in terms of dynamic logic structures. If a dynamic frame is acyclic (i.e., all program statements are irreversible), then it can be specified by means of a two-tape deterministic automaton. Then the equivalence checking problem for sequential programs in which the semantics of operators is determined by acyclic dynamic frames can be reduced to the emptiness problem for two-tape automata (compound machines). [ABSTRACT FROM AUTHOR] |
|
Copyright of Cybernetics & Systems Analysis is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Databáze: |
Complementary Index |
Full Text Finder 
Nájsť tento článok vo Web of Science