Skip to main content
Conference ProceedingsOPEN ACCESS

Interpreting the b-method in the refinement calculus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1708 411-430
DOI: 10.1007/3-540-48119-2_24
5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, we study the B-Method in the light of the theory of refinement calculus. It allows us to explain the proof obligations for a refinement component in terms of standard data refinement. A second result is an improvement of the architectural condition of [PR98], ensuring global correctness of a B software system using the sees primitive.

Cite

CITATION STYLE

APA

Rouzaud, Y. (1999). Interpreting the b-method in the refinement calculus. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1708, pp. 411–430). Springer Verlag. https://doi.org/10.1007/3-540-48119-2_24

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