Skip to main content
Conference Proceedings

From kleene algebra to refinement algebra

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2386 233-262
DOI: 10.1007/3-540-45442-X_14
38Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Kleene Algebra with Tests (KAT) has proved to be useful for reasoning about programs in a partial correctness framework. We describe Demonic Refinement Algebra (DRA), a variation of KAT for total correctness and illustrate its modeling and reasoning power with a number of applications and examples.

Cite

CITATION STYLE

APA

Von Wright, J. (2002). From kleene algebra to refinement algebra. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2386, pp. 233–262). Springer Verlag. https://doi.org/10.1007/3-540-45442-X_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free