Refinement laws for verifying library subroutine adaptation

Hdl Handle:
http://hdl.handle.net/10149/58301
Title:
Refinement laws for verifying library subroutine adaptation
Authors:
Fidge, C. J. (Colin); Robinson, P. (Peter); Dunne, S. E. (Steve)
Affiliation:
University of Queensland. School of Information Technology and Electrical Engineering. Australia; University of Teesside. School of Computing and Mathematics.
Citation:
Fidge, C. J., Robinson, P. and Dunne, S. E. (2005) 'Refinement laws for verifying library subroutine adaptation', Proceedings of The Australian Software Engineering Conference, ASWEC 2005, Brisbane, Australia, March 29 - April 1. IEEE, pp.224-232.
Publisher:
IEEE
Conference:
The Australian Software Engineering Conference, ASWEC 2005, Brisbane, Australia, March 29 - April 1.
Issue Date:
1-Apr-2005
URI:
http://hdl.handle.net/10149/58301
DOI:
10.1109/ASWEC.2005.40
Abstract:
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.
Type:
Meetings and Proceedings
Keywords:
subroutines; library subroutine adaptation; refinement theory; software library modules
ISBN:
1530-0803
Rights:
Author can archive publisher's version/PDF. For full details see http://www.sherpa.ac.uk/romeo/ [Accessed 30/03/2010]
Citation Count:
0 [Web of Science and Scopus, 20/01/2010]

Full metadata record

DC FieldValue Language
dc.contributor.authorFidge, C. J. (Colin)-
dc.contributor.authorRobinson, P. (Peter)-
dc.contributor.authorDunne, S. E. (Steve)-
dc.date.accessioned2009-04-01T10:48:27Z-
dc.date.available2009-04-01T10:48:27Z-
dc.date.issued2005-04-01-
dc.identifier.isbn1530-0803-
dc.identifier.doi10.1109/ASWEC.2005.40-
dc.identifier.urihttp://hdl.handle.net/10149/58301-
dc.description.abstractIn 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.-
dc.publisherIEEE-
dc.rightsAuthor can archive publisher's version/PDF. For full details see http://www.sherpa.ac.uk/romeo/ [Accessed 30/03/2010]-
dc.subjectsubroutines-
dc.subjectlibrary subroutine adaptation-
dc.subjectrefinement theory-
dc.subjectsoftware library modules-
dc.titleRefinement laws for verifying library subroutine adaptation-
dc.typeMeetings and Proceedings-
dc.contributor.departmentUniversity of Queensland. School of Information Technology and Electrical Engineering. Australia; University of Teesside. School of Computing and Mathematics.-
dc.identifier.conferenceThe Australian Software Engineering Conference, ASWEC 2005, Brisbane, Australia, March 29 - April 1.-
ref.assessmentRAE 2008-
ref.citationcount0 [Web of Science and Scopus, 20/01/2010]-
or.citation.harvardFidge, C. J., Robinson, P. and Dunne, S. E. (2005) 'Refinement laws for verifying library subroutine adaptation', Proceedings of The Australian Software Engineering Conference, ASWEC 2005, Brisbane, Australia, March 29 - April 1. IEEE, pp.224-232.-
All Items in TeesRep are protected by copyright, with all rights reserved, unless otherwise indicated.