摘要: Using formal specifications to represent software components facilitates tire determination of reusability because they more precisely characterize the functionality software, and well-defined syntax makes processing amenable automation. This paper presents an approach, based on methods, modification reusable components. From a two-tiered hierarchy components, existing that are general than query specification retrieved from hierarchy. The for component is compared determine what changes need be applied corresponding program in order make it satisfy specification. also describes approach assisting gives example demonstrate its use. >
sci-hub.se 参考文章(20)
Ted J. Biggerstaff, Alan J. Perlis, Concepts and models ACM Press , Addison-Wesley. ,(1989)
Edsger W. Dijkstra, Carel S. Scholten, Predicate Calculus and Program Semantics ,(1989)
Richard Char-Tung Lee, Chin-Liang Chang, Symbolic Logic and Mechanical Theorem Proving ,(1973)
Ted J. Biggerstaff, Alan J. Perlis, Software reusability: vol. 1, concepts and models ACM. ,(1989)
Jun -Jang Jeng, Betty H. C. Cheng, Using Formal Methods to Construct a Software Component Library european software engineering conference. pp. 397- 417 ,(1993) , 10.1007/3-540-57209-0_27
C. Beierle, U. Hedtstück, U. Pletat, P.H. Schmitt, J. Siekmann, An order-sorted logic for knowledge representation systems Artificial Intelligence. ,vol. 55, pp. 149- 191 ,(1992) , 10.1016/0004-3702(92)90055-3
JUN-JANG JENG, BETTY H. C. CHENG, USING AUTOMATED REASONING TECHNIQUES TO DETERMINE SOFTWARE REUSE International Journal of Software Engineering and Knowledge Engineering. ,vol. 02, pp. 523- 546 ,(1992) , 10.1142/S0218194092000245
Uwe Waldmann, Semantics of order-sorted specifications Theoretical Computer Science. ,vol. 94, pp. 1- 35 ,(1992) , 10.1016/0304-3975(92)90322-7
Allen Goldberg, Reusing software developments Proceedings of the fourth ACM SIGSOFT symposium on Software development environments - SDE 4. ,vol. 15, pp. 107- 119 ,(1990) , 10.1145/99277.99288
Joseph A. Goguen, José Meseguer, Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations Theoretical Computer Science. ,vol. 105, pp. 217- 273 ,(1992) , 10.1016/0304-3975(92)90302-V