Data refinement by calculation
Acta Informatica
Formal Methods in System Design
A Discipline of Programming
Formal Proof of Smart Card Applets Correctness
CARDIS '98 Proceedings of the The International Conference on Smart Card Research and Applications
Compositional Symmetric Sharing in B
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Météor: A Successful Application of B in a Large Project
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
SLIPE '85 Proceedings of the ACM SIGPLAN 85 symposium on Language issues in programming environments
Towards Imperative Modules: Reasoning about Invariants and Sharing of Mutable State
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Modular invariants for layered object structures
Science of Computer Programming - Special issue on source code analysis and manipulation (SCAM 2005)
Using b as a high level programming language in an industrial project: roissy VAL
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
B'07 Proceedings of the 7th international conference on Formal Specification and Development in B
A verification methodology for model fields
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
| Hi-index | 0.00 |
This paper deals with modular verification of component invariants in the B Method. On the one hand, B imposes severe architecture restrictions that ensure soundness of component compositions with a few additional proof obligations. On the other hand, in the context of the verification of object oriented programs, Spec# proposes a more expressive approach, but at the price of more complex specifications, and more numerous proof obligations. In this paper, we investigate an intermediate solution combining the advantages of both approaches.