View in EDS

A Formal Basis For Removing Goto Statements.

Saved in:
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
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 80056734
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A Formal Basis For Removing Goto Statements.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Pan%2C+S%2E%22">Pan, S.</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Dromey%2C+R%2E+G%2E%22">Dromey, R. G.</searchLink><relatesTo>1</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Computer+Journal%22">Computer Journal</searchLink>. 1996, Vol. 39 Issue 3, p203-214. 12p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Imperative+programming%22">Imperative programming</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+software+correctness%22">Computer software correctness</searchLink><br /><searchLink fieldCode="DE" term="%22Semantics%22">Semantics</searchLink><br /><searchLink fieldCode="DE" term="%22Redundancy+in+engineering%22">Redundancy in engineering</searchLink><br /><searchLink fieldCode="DE" term="%22Recursion+theory%22">Recursion theory</searchLink><br /><searchLink fieldCode="DE" term="%22Assertions+%28Logic%29%22">Assertions (Logic)</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=80056734
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1093/comjnl/39.3.203
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 12
        StartPage: 203
    Subjects:
      – SubjectFull: Imperative programming
        Type: general
      – SubjectFull: Computer software correctness
        Type: general
      – SubjectFull: Semantics
        Type: general
      – SubjectFull: Redundancy in engineering
        Type: general
      – SubjectFull: Recursion theory
        Type: general
      – SubjectFull: Assertions (Logic)
        Type: general
    Titles:
      – TitleFull: A Formal Basis For Removing Goto Statements.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Pan, S.
      – PersonEntity:
          Name:
            NameFull: Dromey, R. G.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 03
              M: 01
              Text: 1996
              Type: published
              Y: 1996
          Identifiers:
            – Type: issn-print
              Value: 00104620
          Numbering:
            – Type: volume
              Value: 39
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: Computer Journal
              Type: main
ResultId 1