메뉴 건너뛰기




Volumn 176, Issue 2, 2007, Pages 105-124

Only the Best Can Make It: Optimal Component Selection

Author keywords

adaptor code generation; component selection; component based software engineering; cost functions; term rewriting

Indexed keywords

CODES (SYMBOLS); COST FUNCTIONS; OPTIMIZATION; PROGRAM COMPILERS;

EID: 34249028745     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2006.02.034     Document Type: Article
Times cited : (13)

References (14)
  • 1
    • 84976692936 scopus 로고
    • Code Generation for Expressions with Common Subexpressions
    • Aho A.V., Johnson S.C., and Ullman J.D. Code Generation for Expressions with Common Subexpressions. J. ACM 24 (1977) 146-160
    • (1977) J. ACM , vol.24 , pp. 146-160
    • Aho, A.V.1    Johnson, S.C.2    Ullman, J.D.3
  • 4
    • 34249036650 scopus 로고    scopus 로고
    • TM Specification," SUN Microsystems, November 2003, version 2.1, Final Release
  • 5
    • 28044469754 scopus 로고    scopus 로고
    • Verifix: Konstruktion und Architektur verifizierender Übersetzer (Verifix: Construction and Architecture of Verifying Compilers)
    • Glesner S., Goos G., and Zimmermann W. Verifix: Konstruktion und Architektur verifizierender Übersetzer (Verifix: Construction and Architecture of Verifying Compilers). it - Information Technology 46 (2004) 265-276
    • (2004) it - Information Technology , vol.46 , pp. 265-276
    • Glesner, S.1    Goos, G.2    Zimmermann, W.3
  • 7
    • 34249061955 scopus 로고    scopus 로고
    • Hemer, D., A formal approach to component adaptation and composition, in: ACSW '05, Australasian Computer Science Week, 2005
  • 8
    • 34249045015 scopus 로고    scopus 로고
    • Kopp, S., N. Krämer, L. Gesellensetter and I. Wachsmuth, A conversational agent as museum guide - design and evaluation of a real-world application, in: 5th Int. working conference on Intelligent Virtual Agents (IVA'05), 2005
  • 9
    • 0031295105 scopus 로고
    • Code generation based on formal BURS theory and heuristic search
    • Nymeyer A., and Katoen J.-P. Code generation based on formal BURS theory and heuristic search. Acta Informatica 34 (1995) 597-635
    • (1995) Acta Informatica , vol.34 , pp. 597-635
    • Nymeyer, A.1    Katoen, J.-P.2
  • 10
    • 0033307013 scopus 로고    scopus 로고
    • Page, E.H. and J.M. Opper, Observations on the complexity of composable simulation, in: WSC '99: 31st conf. on Winter simulation (1999), pp. 553-560
  • 11
    • 34249103802 scopus 로고    scopus 로고
    • Petty, M., E.W. Weisel and R.R. Mielke., Computational complexity of selecting models for composition, in: Proceedings of the Fall 2003 Simulation Interoperability Workshop, Orlando FL, 2003, pp. 517-525
  • 12
    • 18744396079 scopus 로고    scopus 로고
    • Upadhyayaand, B.Z.L., Formal support for development of javabeans component systems, in: 28th Annual International Computer Software and Applications Conference (COMPSAC'04), 2004, pp. 23-28
  • 13
    • 85094097385 scopus 로고    scopus 로고
    • Weerawarana, S., F. Curbera, M.J. Duftler, D.A. Epstein and J. Kesselman, Bean markup language: A composition language for javabeans components, in: COOTS 2001, 2001


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.