Semantic distance between specifications

Theoretical Computer Science

Volumn 247, Issue 1-2, 2000, Pages 257-276

  Mili, Rym ^a   Desharnais, Jules ^b   Frappier, Marc ^c   Mili, Ali ^d  

^a UNIVERSITY OF TEXAS AT DALLAS   (United States)

^b UNIVERSITÉ LAVAL   (Canada)

^c UNIVERSITÉ DE SHERBROOKE   (Canada)

^d West Virginia University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000534417     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00085-7     Document Type: Article

References (37)

1. R. Backhouse, P. Hoogendijk, E. Voermans, J. Van der Woude, A relational theory of data types, Research Report, Department of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands, 1992.
2. R.D. Banker, R.J. Kauffman, D. Zweig, Repository Evaluation of Software Reuse, IEEE Trans. Software Eng. 19 (4) (1993) 379-389.
3. R. Berghammer, G. Schmidt, H. Zierer, Symmetric quotients and domain constructions, Inform. Process. Lett. 33 (1989) 163-168.
4. T.J. Biggerstaff, A.J. Perlis, Software Reusability, vol. 1: Concepts and Models, ACM Press, New York, 1989.
5. G. Birkhoff, Lattice Theory, American Mathematical Society, Providence, RI, 1967.
6. N. Boudriga, F. Elloumi, A. Mili, The lattice of specifications: applications to a specification methodology, Formal Aspects Comput. 4 (1992) 544-571.
7. J. Desharnais, N. Belkhither, S. Sghaier, F. Tchier, A. Jaoua, A. Mili, N. Zaguia, Embedding a demonic semi-lattice in a relation algebra, Theoret. Comput. Sci. (149) (1995) 333-360
8. P. Devanbu, R. Brachman, P. Selfridge, B. Ballard, LaSSIE: a knowledge-based software information system, Comm. ACM 34 (5) (1991) 34-49.
9. M. Frappier, A relational basis for program construction by parts, Ph.D. Dissertation, University of Ottawa, October 1995.
10. M. Frappier, J. Desharnais, A. Mili, A calculus of program construction by parts, Proc. Mathematics of Program Construction, Kloster Irsee, Germany, Lecture Notes in Computer Science, Springer, Berlin, July 1995.
11. M. Frappier, J. Desharnais, A. Mili, A calculus of program construction by parts, SCICOP 26 (1-3), (1996) 237-254.
12. W.B. Frakes, T.P. Pole, Proteus: a reuse library system that supports multiple representation methods, ACM SIGIR Forum 24 (1990) 43-55.
13. W.B. Frakes, T.P. Pole, Empirical study of software reuse, IEEE Trans. Software Eng. 20 (8) (1994) 617-630.
14. R.J. Hall, Generalized behavior-based retrieval, Proc. 16th Internat. Conf. on Software Engineering, Sorento, Italy, ACM Press, New York, May 1994.
15. C.A.R. Hoare, J.F. He, The weakest prespecification, Fund. Inform. IX (1986) (Part I) 51-58; Part (II) (1986) 217-252.
16. C.A.R. Hoare, J.F. He, The weakest prespecification, Fund. Inform. IX (1986) (Part I) 51-58; Part (II) (1986) 217-252.
17. C.A.R. Hoare, J.F. He, The weakest prespecification, Inform. Process. Lett. 24 (1987) 127-132.
18. J.J. Jeng, B.H.C. Cheng, A formal approach to reusing more general components, IEEE 9th Knowledge-based Software Engineering Conf., Monterey, CA, September 1994, pp. 90-97.
19. B. Jonsson, Varieties of relation algebras, Algebra Univ. 15 (1982) 273-298.
20. M.B. Josephs, An introduction to the theory of specification and refinement, IBM Research Report RC 12993, July 1987.
21. Y.S. Maarek, D.M. Berry, The use of lexical affinities in requirements extraction, Proc. 5th Internat. Workshop on Software Specification and Design, Pittsburgh, Pa, May 1989.
22. R. Mili, Determining the reuse worthiness of a component: empirical and analytical approaches, Ph.D. Dissertation, University of Ottawa, Fall 1996.
23. R. Mili, A. Mili, R. Mittermeir, Storing and retrieving software component: a refinement based approach, IEEE Trans. Software Eng. 23 (7) (1997) 445-460.
24. T. Moineau, M.C. Gaudel, Software reusability through formal specifications, in Proc. Internat. Workshop on Software Reusability, number Memo No. 57, Dortmund, 1991.
25. E. Ostertag, J. Hendler, R. Prieto-Diaz, C. Braun, Computing similarity in a reuse library system: an AI-based approach, ACM Trans. Software Eng. Methodol. 1 (3) (1992) 205-228.
26. D.E. Perry, S.S. Popovich, Inquire: predicate-based use and reuse, Proc. Knowledge Based Software Engineering Conf., Chicago, IL, September 1993.
27. A. Podgurski, L. Pierce, Retrieving reusable software by sampling behavior, ACM Trans. Software Eng. Methodol. 2 (3) (1993) 286-303.
28. R. Prieto-Diaz, P. Freeman, Classifying software for reusability, IEEE Software 4 (1) (1987) 6-16.
29. R. Prieto-Diaz, Implementing faceted classification for software reuse, Comm. ACM 34 (1991) 88-97.
30. M. Rittri, Using types as search keys in function libraries, Conf. on Functional Programming Languages and Computer Architectures, Addison-Wesley, Reading, MA, 1989.
31. G. Schmidt, T. Ströhlein, Relations and Graphs, Springer, Berlin, Germany, 1990.
32. M. Sitaraman et al., Components based software using resolve, in: W. Tracz (Ed.), SIGSOFT Software Engineering Notes, ACM Press, New York, 1994.
33. G. Spanoudakis, P. Constantopoulos, measuring similarity between software artifacts, in Proc. Software Engineering and Knowledge Engineering Conference, Jurmala, Latvia, June 1994.
34. R.A. Steigerwald, Reusable component retrieval with formal specifications, in Proc. 5th Annual Workshop on Software Reuse, October 1992.
35. B.W. Weide, W.F. Ogden, S.H. Zweben, Reusable software components, in: M.C. Yovits (Ed.), Advances in Computers, Academic Press, New York, 1991, pp. 1-65.
36. A. Moormann Zaremski, J.M. Wing, Signature Matching: A Tool for Using Software Libraries, ACM Trans. Software Eng. Methodol. 4 (2) (1995) 146-170.
37. A. Moorman Zaremski, J.M. Wing, Specification matching of software components, in Proc. SIGSOFT '95: 3rd ACM SIGSOFT Symp. on the Foundations of Software Engineering, ACM Press, New York.