hig.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard-cite-them-right
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • sv-SE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • de-DE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Normal forms in total correctness for while programs and action systems
Uppsala universitet, Avdelningen för teoretisk filosofi.
2011 (English)In: Journal of Logic and Algebraic Programming, ISSN 1567-8326, E-ISSN 1873-5940, Vol. 80, no 6, p. 362-375Article in journal (Refereed) Published
Abstract [en]

A classical while-program normal-form theorem is derived in demonic refinement algebra. In contrast to Kozen's partial-correctness proof of the theorem in Kleene algebra with tests, the derivation in demonic refinement algebra provides a proof that the theorem holds in total correctness. A normal form for action systems is also discussed.

Place, publisher, year, edition, pages
Elsevier , 2011. Vol. 80, no 6, p. 362-375
National Category
Other Humanities
Identifiers
URN: urn:nbn:se:hig:diva-45147DOI: 10.1016/j.jlap.2011.04.008ISI: 000292228200007OAI: oai:DiVA.org:hig-45147DiVA, id: diva2:1881580
Available from: 2011-07-19 Created: 2024-07-03 Last updated: 2025-02-07Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records

Solin, Kim

Search in DiVA

By author/editor
Solin, Kim
In the same journal
Journal of Logic and Algebraic Programming
Other Humanities

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 13 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard-cite-them-right
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • sv-SE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • de-DE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf