uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
Enabledness and termination in refinement algebra
Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Arts, Department of Philosophy, Logic and Metaphysics.
2009 (English)In: Science of Computer Programming, ISSN 0167-6423, Vol. 74, no 8, 654-668 p.Article in journal (Refereed) Published
Abstract [en]

Refinement algebras are abstract algebras for reasoning about programs in a total correctness framework. We extend a reduct of von Wright's demonic refinement algebra with two operators for modelling enabledness and termination of programs. We show how the operators can be used for expressing relations between programs and apply the algebra to reasoning about action systems.

Place, publisher, year, edition, pages
2009. Vol. 74, no 8, 654-668 p.
Keyword [en]
Refinement algebra, Enabledness, Termination, Action systems
National Category
URN: urn:nbn:se:uu:diva-148835DOI: 10.1016/j.scico.2007.11.004ISI: 000266671700008OAI: oai:DiVA.org:uu-148835DiVA: diva2:403358
Available from: 2011-03-12 Created: 2011-03-10 Last updated: 2013-12-30

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Solin, Kim
By organisation
Logic and Metaphysics
In the same journal
Science of Computer Programming

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 173 hits
ReferencesLink to record
Permanent link

Direct link