类型化移动资源
作者:
基金项目:

Supported by the National Natural Science Foundation of China under Grant No60173033 (国家自然科学基金)

  • 摘要
  • | |
  • 访问统计
  • |
  • 参考文献 [16]
  • |
  • 相似文献 [20]
  • |
  • 引证文献
  • | |
  • 文章评论
    摘要:

    在移动资源演算(MR)中发现了一种干扰现象,称为直接访问干扰,该现象比移动灰箱演算(MA)中的墙干扰现象更具破坏力,因为在MR中恶意的环境或上下文可以不受限制地访问进程内部的敏感资源.因而该干扰问题当被视为一种程序运行错误.为了控制直接干扰现象,提出了一种MR的变体:安全移动资源演算(SR).它使用了一种类型系统来避免所有的直接访问干扰的发生.基于该研究,MA中的强干扰现象实际上是直接访问干扰的一种特殊形式,自然地,在SR中也得到了相应的控制.最后给出一些用例,说明如何使用新设计的演算系统,以及它的健壮性.

    Abstract:

    A kind of interference, called direct access interference, is found in the calculus of Mobile Resources(MR), which will cause more damage than the grave interference one finds in the calculus of Mobile Ambients,because in MR malicious environments or contexts can freely access the sensitive resources inside a process. This kind of interference should be regarded as a program error. To control the direct access interference, we devise a variant of MR, the calculus of Safe Mobile Resources (SR). The authors use a type system to avoid the occurrence of all direct access interferences. Due to the study, the grave interference is a special form of the direct access interference, which is also controlled in SR. At the end of the paper, several examples are provided to illustrate how to use the new calculus and how robust it is.

    参考文献
    [1]Cardelli L, Gordon AD. Mobile ambients. In Nivat M, ed. Foundations of Software Science and Computation Structure Heidelberg: Springer Verlag, LNCS 1378, 1998.140-155.
    [2]Godskesen JC, Hildebrandt T, Sassone V. A calculus of mobile resources. In Brim L, ed. Concurrency Theory. Heidelberg:Springer Verlag, 2002.272-287.
    [3]Levi F, Sangiorgi D. Controlling interference in ambients. In Reps T, ed. Symp. on Principles of Programming Languages New York: ACM Press, 2000. 352-364.
    [4]Milner R. Communication and Concurrency. New York: Prentice Hall, 1989.
    [5]Milner R, Parrow J, Walker D. A calculus of mobile process, (Part Ⅰ and Ⅱ). Information and Computation1992,100:l-77.
    [6]Bugliesi M, Crafa S, Merro M, Sassone V. Communication interferences in mobile boxed ambients. In Agrawal M, ed.Foundations of Software Technology and Theoretical Computer Science Heidelberg: Springer Verlag, LNCS 2556, 2002.71-84.
    [7]Bugliesi M, Castagna G, Crafa S. Boxed ambients. In: Kobayashi N, ed. Theoretical Aspects of Computer Software Heidelberg:Springer Verlag, LNCS 2215, 2001.38-63.
    [8]Guan XD, Yang YL, You JY. Making ambients more robust. In Kurki-Suonio N, ed. Int'l Conf. on Software: Theory and Practice.Beijing: PHEI Press, 2000. 377-384.
    [9]Guan XD, Yang YL, You JY. Typing evolving ambients. Information Processing Letters, 200180(5):265-270.
    [10]Cardelli L. Type system. In: Tucker AB, ed. The Computer Science and Engineering Handbook Boca Raton: CRC Press, 1997.2208-2236.
    [11]Zimmer P. Subtyping and typing algorithms for mobile ambients. In Tiuryn J, ed. Foundations of Software Science and Computation Structure. Heidelberg: Springer Verlag, LNCS 1784, 2000.375-390.
    [12]Cardelli L, Gordon AD. Types for mobile ambients. In Aiken A, ed. Symp. on Principles of Programming Languages New York:ACM Press, 1999. 79-92.
    [13]Cardelli L, Ghelli G, Gordon AD. Mobility types for mobile ambients. In: Wiedermann J, ed. Automata, Languages and Programming. Heidelberg: Springer Verlag, LNCS 1644, 1999. 230-239.
    [14]Fu C, You JY. Application modeling based on typed resources. In Li ML, ed. Grid and Cooperative Computing Heidelberg:Springer Verlag, LNCS 3033, 2004. 628-635.
    [15]Levi F. Types for evolving communication in safe ambients. In Zuck LD, ed. Verification, Model Checking, and Abstract Interpretation. Heidelberg: Springer Verlag, LNCS 2575, 2003. 102-115.
    [16]Coppo EGM, Dezani-Ciancaglini M, Salvo I. M3: Mobility types for mobile processes in mobile ambients. In Herland J, ed.Computing: The Australasian Theory Symp. Elsevier, ENTCS 78, 2003. 1-34.
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

傅城,尤晋元.类型化移动资源.软件学报,2005,16(5):979-990

复制
分享
文章指标
  • 点击次数:3880
  • 下载次数: 4961
  • HTML阅读次数: 0
  • 引用次数: 0
历史
  • 收稿日期:2003-12-12
  • 最后修改日期:2004-11-03
文章二维码
您是第19868386位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号