Weakest preconditioned goto axiom

This paper presents an axiom for goto statements in terms of Dijkstra's weakest (liberal) precondition model. We give a detailed comparison of our axiom with Arbib and Alagic's approach and argue that the latter is actually flawed even if it offers a goto axiom that has widely been cited a...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information processing letters Ročník 180; s. 106329
Hlavní autor: Chen, Wei
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.02.2023
Témata:
Formal semantics
Goto axiom and proof rules
Programming logic
Weakest liberal precondition
Weakest liberal precondition
Programming logic
Goto axiom and proof rules
Formal semantics
ISSN:0020-0190, 1872-6119
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper presents an axiom for goto statements in terms of Dijkstra's weakest (liberal) precondition model. We give a detailed comparison of our axiom with Arbib and Alagic's approach and argue that the latter is actually flawed even if it offers a goto axiom that has widely been cited and adopted.
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2022.106329