节点文献

消除有限容量演算中的强干扰

Eliminating Grave Interference in Bounded Capacities

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 钟发荣贾陈建明傅育熙

【Author】 ZHONG Fa-rong 1,2 , JIA Jiong1, CHEN Jian-ming1, FU Yu-xi2(1. Dept. of Computer Science, Zhejiang Normal Univ., Jinhua 321004, China;2. Dept. of Computer Science & Eng., Shanghai Jiaotong Univ., Shanghai 200030)

【机构】 浙江师范大学计算机系上海交通大学计算机科学与工程系 金华321004上海交通大学计算机科学与工程系上海200030金华321004上海200030

【摘要】 为了消除有限容量演算中的强干扰和控制资源的移动,改进了该演算的某些原语,提出了一种新的演算——安全有限容量演算.在新演算中,调整了2个能力,增加了3个能力(相当于动作)和2个余能力(余动作),并改进相应的归约语义,给出了安全有限容量演算的类型系统.该类型系统控制灰箱的移动性和线程数,并保证在计算过程中灰箱所拥有的资源数被静态地保持在其资源数范围内.

【Abstract】 There are some grave interferences in the calculus of bounded capacities(BoCa) , which can be baleful and can be considered as programming errors. In order to eliminate these grave interferences and to dominate the movement of resources, some BoCa primitives were modified. A new calculus, the safe bounded capacities (Safe BoCa) was proposed which modifies two capacities and adds three new capabilities and two new co-capabilities. The reduction semantics is modified accordingly. A type system for the Safe BoCa is given to control the mobility of ambients and the number of threads, and to guarantee that the intended capacity bounds are statically preserved throughout computation.

【基金】 国家杰出青年科学基金资助项目(60225012);上海市科委重点项目(025115032)
  • 【文献出处】 上海交通大学学报 ,Journal of Shanghai Jiaotong University , 编辑部邮箱 ,2005年08期
  • 【分类号】TP301
  • 【下载频次】25
节点文献中: 

本文链接的文献网络图示:

本文的引文网络