Semantic Component Behavior Equivalence Analysis based on Higher-order Typed π Calculus

被引:0
|
作者
Wu, Qing [1 ]
Zhao, Chunbo [1 ]
Hu, Weihua [1 ]
机构
[1] Hangzhou Dianzi Univ, Coll Comp Sci, Hangzhou, Zhejiang, Peoples R China
关键词
semantic component; component behavior equivalence;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
It is an important issue to analyze the behavioral equivalence of semantic components when studying the dynamic replacement and recombination of them for middleware adaptation. However it is difficult to check the equivalence of behaviors rapidly and precisely. In order to improve the precision of judging, and guarantee the normality and stability of system after replacing and recombining components, the paper mainly uses and extends the theories of equivalence analysis based on higher-order typed pi calculus. By analyzing the equivalence of semantic components, it can ensure the behavioral consistency of the new component and replaced component, also effectively guarantee the stability and normality of the whole middleware system's dynamic adaptation.
引用
收藏
页码:115 / 118
页数:4
相关论文
共 50 条
  • [1] Behavioural equivalence and indistinguishability in higher-order typed languages
    Katsumata, S
    [J]. RECENT TRENDS IN ALGEBRAIC DEVELOPMENT TECHNIQUES, 2003, 2755 : 284 - 298
  • [2] CONTEXTUAL EQUIVALENCE FOR HIGHER-ORDER π-CALCULUS REVISITED
    Jeffrey, Alan
    Rathke, Julian
    [J]. LOGICAL METHODS IN COMPUTER SCIENCE, 2005, 1 (01)
  • [3] Typed higher-order narrowing without higher-order strategies
    Antoy, S
    Tolmach, A
    [J]. FUNCTIONAL AND LOGIC PROGRAMMING, PROCEEDINGS, 1999, 1722 : 335 - 352
  • [4] Semantic navigation of large code bases in higher-order, dynamically typed languages
    Spoon, SA
    Shivers, O
    [J]. WCRE: 12th Working Conference on Reverse Engineering 2005, Proceedings, 2005, : 219 - 228
  • [5] Reversibility in the higher-order π-calculus
    Lanese, Ivan
    Mezzina, Claudio Antares
    Stefani, Jean-Bernard
    [J]. THEORETICAL COMPUTER SCIENCE, 2016, 625 : 25 - 84
  • [6] A Reflective Higher-order Calculus
    Meredith, L. G.
    Radestock, Matthias
    [J]. ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2005, 141 (05) : 49 - 67
  • [7] BINDING TIME ANALYSIS FOR POLYMORPHICALLY TYPED HIGHER-ORDER LANGUAGES
    MOGENSEN, TAE
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1989, 352 : 298 - 312
  • [8] Independent component analysis based on higher-order statistics only
    DeLathauwer, L
    DeMoor, B
    Vandewalle, J
    [J]. 8TH IEEE SIGNAL PROCESSING WORKSHOP ON STATISTICAL SIGNAL AND ARRAY PROCESSING, PROCEEDINGS, 1996, : 356 - 359
  • [9] Higher-order lazy narrowing calculus: A solver for higher-order equations
    Ida, T
    Marin, M
    Suzuki, T
    [J]. COMPUTER AIDED SYSTEMS THEORY - EUROCAST 2001, 2001, 2178 : 479 - 493
  • [10] A typed semantics of higher-order store and subtyping
    Schwinghammer, J
    [J]. THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2005, 3701 : 390 - 405