Bibliographic Details
| Title: |
A Formal Basis For Removing Goto Statements. |
| Authors: |
Pan, S.1, Dromey, R. G.1 |
| Source: |
Computer Journal. 1996, Vol. 39 Issue 3, p203-214. 12p. |
| Subjects: |
Imperative programming, Computer software correctness, Semantics, Redundancy in engineering, Recursion theory, Assertions (Logic) |
| Abstract: |
Goto statements detract from the quality of imperative programs. They tend to make control-structures difficult to understand and, at the same time, introduce the risk of non-termination and other correctness problems. A new, formal, generally applicable procedure for removing all goto statements from program structures is presented. This method is based on formal semantics and congruent equivalence transformations. Not only does the method logically simplify program structures; it also detects a range of defects including a class of non-termination problems, unreachable code and redundancy problems. The method can also be used to eliminate recursion. [ABSTRACT FROM AUTHOR] |
|
Copyright of Computer Journal is the property of Oxford University Press / USA 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.) |
| Database: |
Engineering Source |
