Bibliothek

X
feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
Datenquelle
Materialart
Erscheinungszeitraum
  • 1
    Digitale Medien
    Digitale Medien
    A case study in program transformation (1976)
    Springer
    BIT 16 (1976), S. 322-331 
    Details
    ISSN: 1572-9125
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract A simple problem relating to binary trees is considered, and a recursive program is proved to solve this problem. The program may be transformed into a more efficient iterative one, usinggoto-statements and explicit stack handling. An independent correctness proof for this transformed version is given and compared with the original proof. Finally it is shown how a non-recursive conception of the problem may yield a structured iterative program, based onwhile-statements. A proof of this program is presented, reflecting its non-recursive conception, and it turns out that this proof has little similarity with the other two.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF01932275
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 2
    Digitale Medien
    Digitale Medien
    Coroutine sequencing in a block structured environment (1971)
    Springer
    BIT 11 (1971), S. 425-449 
    Details
    ISSN: 1572-9125
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract A certain primitive sequencing operation is defined, applicable as an extension to Algol-like languages. The operation serves the double purpose of “intermediate exit” from or “reentry” into procedure-like block instances. A second primitive, which corresponds to a fully symmetric coroutine linkage, is derived from the former. An abstract notation is introduced for the concepts of textual and dynamic enclosure of block instances. The effects of the sequencing primitives are explored in terms of this notation, and certain results are proved. Finally applications are given within the language framework of Simula 67.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF01939412
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 3
    Digitale Medien
    Digitale Medien
    An axiomatic basis for proving total correctness of goto-programs (1976)
    Springer
    BIT 16 (1976), S. 88-102 
    Details
    ISSN: 1572-9125
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract The paper presents an axiomatic basis, similar to that of Hoare, for proving properties about programs by decomposition into proofs about the syntactical program-components. In addition to the partial correctness, which can be proved by Hoare's method, the present basis includes the aspect of termination, i.e. total correctness. Moreover, it is shown how partial and total correctness may be handled within a unified framework. Among the basic program components agoto-statement is considered. Thewhile-statement is defined in terms of more basic constructions, and some useful and familiar theorems are proved. The subject of recursive procedures is treated briefly.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF01940782
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...