Formal Methods for Component Software: The Refinement Calculus Perspective (1997)
| Venue: | PROCEEDINGS OF THE SECOND WORKSHOP ON COMPONENT-ORIENTED PROGRAMMING (WCOP), VOLUME 5 OF TUCS GENERAL PUBLICATION, PAGES 23–32, SHORT VERSION IN ECOOP’97 WORKSHOP READER LNCS 1357 |
| Citations: | 21 - 3 self |
BibTeX
@INPROCEEDINGS{Büchi97formalmethods,
author = {Martin Büchi and Emil Sekerinski},
title = {Formal Methods for Component Software: The Refinement Calculus Perspective},
booktitle = {PROCEEDINGS OF THE SECOND WORKSHOP ON COMPONENT-ORIENTED PROGRAMMING (WCOP), VOLUME 5 OF TUCS GENERAL PUBLICATION, PAGES 23–32, SHORT VERSION IN ECOOP’97 WORKSHOP READER LNCS 1357},
year = {1997},
pages = {23--32},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We exhibit the benefits of using formal methods for constructing and documenting component software. Formal specifications provide concise and complete descriptions of black-box components and, herewith, pave the way for full encapsulation. Specifications using abstract statements scale up better than prepostconditions and allow for `relative' specifications because they may refer to other components. Nondeterminism in specifications permits enhancements and alternate implementations. A formally verifiable refinement relationship between specification and implementation of a component ensures compliance with the published specification. Unambiguous and complete contracts are the foundation of any component market.
