移动灰箱演算中强干扰问题的进一步控制  

Further Control on the Grave Interference in Mobile Ambient

作　　者：管旭东[1] 杨怡玲[1] 尤晋元[1] 

机构地区：[1]上海交通大学计算机科学与工程系分布计算技术中心,上海200030

出　　处：《软件学报》2002年第5期1018-1023,共6页Journal of Software

基　　金：上海市科技发展基金资助项目(995115014)~~

摘　　要：为了消除移动灰箱演算中的强干扰问题,Levi等人提出了安全灰箱演算.然而,安全灰箱演算中引入的反动作却带来了新的安全隐患.为了消除上述安全隐患,提出了鲁棒灰箱演算.鲁棒灰箱演算在依靠反动作解决强干扰问题的同时,利用反动作的参数明确了该反动作的使用对象,有效地消除了安全灰箱演算中的不安全因素.对防火墙跨越的描述和对多元异步p-演算的翻译显示鲁棒灰箱演算依然具有较强的类似移动灰箱演算和安全灰箱演算的表达能力.同时还就鲁棒灰箱演算的类型问题作了初步的探讨,给出并证明了一套可以描述进程和能力的移动性和线程数两个属性的类型系统.研究结果初步表明,鲁棒灰箱演算可以成为移动计算形式化描述中的有力工具.In order to control the grave interference in mobile ambient (MA), Levi et al. proposed mobile safe ambients (SA). However, the coactions introduced in SA brought new security breaches. In this paper, robust ambients (ROAM) is proposed to eliminate those security breaches. In ROAM, coactions are still utilized to control the grave interference. In addition, the parameter of every coaction is explicitly specified to name the consumer of that coaction. This mechanism effectively eliminates the security breaches in SA. The firewall crossing example and the encoding of polyadic asynchronous p-calculus in ROAM show that ROAM still keeps the strong expressiveness of its ancestors. A fundamental type system for ROAM with both thread count and mobility attributes is also proposed and proved. The result in this paper shows that ROAM is a good candidate in the formalization of mobile computation.

关 键 词：进程代数 移动灰箱演算 强干扰 防火墙 INTRANET 类型 

分 类 号：TP393.18[自动化与计算机技术—计算机应用技术]