loading...
Refinement Laws for Verifying Library Subroutine Adaptation
Brisbane, Australia March 29-April 01
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ASWEC.2005.402005 Australian Software Engineering ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Colin Fidge, University of Queensland
Peter Robinson, University of Queensland
Steve Dunne, University of Teesside
In Component-Based Software Engineering programs are constructed from pre-defined software library modules. However, if the library?s subroutines do not exactly match the programmer?s requirements, the subroutines? code must be adapted accordingly. For this process to be acceptable in safety or mission-critical applications, where all code must be proven correct, it must be possible to verify the correctness of the adaptations themselves. In this paper we show how refinement theory can be used to model typical adaptation steps and to define the conditions that must be proven to verify that a library subroutine has been adapted correctly.
Citation:
Colin Fidge, Peter Robinson, Steve Dunne, "Refinement Laws for Verifying Library Subroutine Adaptation," aswec, pp.224-232, 2005 Australian Software Engineering Conference (ASWEC'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.