Contextual matching of software library components
Many automated programming environments construct software by integrating predefined components from a software library. A fundamental challenge in this process is to match the programmer's specified requirements against the stated capabilities of the components. We explain how the chances of s...
Saved in:
Published in: | Ninth Asia-Pacific Software Engineering Conference, 2002 pp. 297 - 306 |
---|---|
Main Author: | |
Format: | Conference Proceeding |
Language: | English |
Published: |
IEEE
2002
|
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Many automated programming environments construct software by integrating predefined components from a software library. A fundamental challenge in this process is to match the programmer's specified requirements against the stated capabilities of the components. We explain how the chances of successfully achieving a match can be increased by taking the program context surrounding each requirement into consideration. Formal rules, based on program refinement theory, are defined for context-based matching. The rules allow properties that can be proven to hold at a particular point in the program to justify matching with components that operate correctly only in such a context. |
---|---|
ISBN: | 0769518508 9780769518503 |
ISSN: | 1530-1362 2640-0715 |
DOI: | 10.1109/APSEC.2002.1182999 |