ACM Home Page
Please provide us with feedback. Feedback
Toward a formal theory of extensible software
Full text PdfPdf (862 KB)
Source Foundations of Software Engineering archive
Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering table of contents
Lake Buena Vista, Florida, United States
Pages: 88 - 98  
Year of Publication: 1998
ISBN:1-58113-108-9
Also published in ...
Authors
Shriram Krishnamurthi  Department of Computer Science, Rice University, Houston, TX
Matthias Felleisen  Department of Computer Science, Rice University, Houston, TX
Sponsors
SIGSOFT: ACM Special Interest Group on Software Engineering
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 26,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/288195.288269
What is a DOI?

ABSTRACT

As software projects continue to grow in scale and scope, it becomes important to reuse software. An important kind of reuse is extensibility, i.e., the extension of software without accessing existing code to edit or copy it. In this paper, we propose a rigorous, semantics-based definition of software extensibility. Then we illustrate the utility of our definitions by applying them to several programs. The examination shows how programming style affects extensibility and also drives the creation of a variant of an existing design pattern. We consider programs in both object-oriented and functional languages to prove the robustness of our definitions.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

2
3
 
4
Brown, K. G. Design reverse-engineering and automated design pattern detection in smalltalk. Master' s thesis, North Carolina State University, 1996.
 
5
 
6
Drossopoulou, S. and S. Eisenbach. Java is type safeprobably. In European Conference on Object-Oriented Programming, pages 389-418, 1997.
7
 
8
 
9
 
10
 
11
Findler, R. B. Modular abstract interpreters. Unpublished manuscript, Carnegie Mellon University, June 1995.
12
13
 
14
Frappier, hiI., A. h&li and R. Ben Ayed. A relational calculus for software reuse. In IJCAI Workshop on Formal Approaches to the Reuse of Plans, Proofs and Programs, 1995.
 
15
 
16
17
 
18
19
 
20
21
 
22
McIhoy, M. D. Mass produced software components. In Naur, P. and B. Randell, editors, Report on a Conference of the NATO Science Committee, pages 138-150, October 1968.
 
23
 
24
 
25
 
26
Nierstrasz, O., J.-G. Schneider and M. Lumpe. Formalizing composable software systems - a research agenda. In IFIP Workshop on Formal Methods for Open Object-based Distributed Systems, 1996.
 
27
 
28
Pouhn, J. S. Measuring Software Reuse: Principies, Practices, and Economic Models. Addison-Wesley, 1997.
 
29
 
30
 
31
 
32


Collaborative Colleagues:
Shriram Krishnamurthi: colleagues
Matthias Felleisen: colleagues