Specification of computer programs
Specification of computer programs
On the Modularization Theorem for logical specifications
Information Processing Letters
Accommodating interference in the formal design of concurrent object-based programs
Formal Methods in System Design
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Making the most of formal specification through animation, testing and proof
Science of Computer Programming - Special issue on COST 247, verification and validation methods for formal descriptions
On a generalized modularization theorem
Information Processing Letters - Special issue analytical theory of fuzzy control with applications
Object-Oriented Software Construction
Object-Oriented Software Construction
Proceedings of the Fifth Annual Z User Meeting on Z User Workshop
Composition and Refinement in the B-Method
B '98 Proceedings of the Second International B Conference on Recent Advances in the Development and Use of the B Method
Synthesising Structure from Flat Specifications
B '98 Proceedings of the Second International B Conference on Recent Advances in the Development and Use of the B Method
Notes on refinement, interpolation and uniformity
ASE '97 Proceedings of the 12th international conference on Automated software engineering (formerly: KBSE)
Parameterising (Algebraic) Specifications on Diagrams
ASE '98 Proceedings of the 13th IEEE international conference on Automated software engineering
Process Algebra and Non-interference
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Type Synthesis in B and the Translation of B to PVS
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
Towards dynamically communicating abstract machines in the b method
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
| Hi-index | 0.00 |
The B-Method provides a collection of structuring mechanisms which support information hiding, modularisation and compositionality of module operations, although, in order to achieve compositionality and independent (parallel) refinement, sharing is restricted in B. In this paper we elaborate some non-interference and compositionality assumptions that underlie structuring mechanisms such as USES, SEES and imports and show how they may be violated by inducing emerging properties which alter the context of the used, seen or imported machine. We discuss how such situations can be avoided by considering necessary and sufficient conditions for logical conservativeness and modularisation. As proof obligations, these conditions ensure that the properties of the context of the seen, used or imported component are conserved, i.e. that they are preserved but not enriched. From a logical viewpoint, these proof obligations require that the uniform interpolant of the contextual extension axioms is implied by the base context.