Enabledness and termination in refinement algebra

Solin, Kim and von Wright, Joakim (2009) Enabledness and termination in refinement algebra. Science of Computer Programming, 74 8: 654-668. doi:10.1016/j.scico.2007.11.004

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads

Author Solin, Kim
von Wright, Joakim
Title Enabledness and termination in refinement algebra
Journal name Science of Computer Programming   Check publisher's open access policy
ISSN 0167-6423
1872-7964
Publication date 2009-06-01
Sub-type Article (original research)
DOI 10.1016/j.scico.2007.11.004
Volume 74
Issue 8
Start page 654
End page 668
Total pages 15
Place of publication Amsterdam, Netherlands
Publisher Elsevier
Language eng
Subject 1712 Software
Abstract 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.
Keyword Action systems
Enabledness
Refinement algebra
Termination
Q-Index Code C1
Q-Index Status Provisional Code
Institutional Status Non-UQ

Document type: Journal Article
Sub-type: Article (original research)
Collection: School of Information Technology and Electrical Engineering Publications
 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 9 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 8 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Fri, 21 Mar 2014, 19:04:11 EST by Kim Solin on behalf of Scholarly Communication and Digitisation Service