首页> 外文会议>Programming Languages and Systems >Type-Based Deadlock-Freedom Verification for Non-Block-Structured Lock Primitives and Mutable References
【24h】

Type-Based Deadlock-Freedom Verification for Non-Block-Structured Lock Primitives and Mutable References

机译:非块结构的锁基元和可变引用的基于类型的死锁自由验证

获取原文
获取原文并翻译 | 示例

摘要

We present a type-based deadlock-freedom verification for concurrent programs with non-block-structured lock primitives and mutable references. Though those two features are frequently used, they are not dealt with in a sufficient manner by previous verification methods. Our type system uses a novel combination of lock levels, obligations and ownerships. Lock levels are used to guarantee that locks are acquired in a specific order. Obligations and ownerships guarantee that an acquired lock is released exactly once.
机译:我们为具有非块结构的锁原语和可变引用的并发程序提供基于类型的无死锁验证。尽管经常使用这两个功能,但是以前的验证方法并未对它们进行足够的处理。我们的类型系统使用了锁级别,义务和所有权的新颖组合。锁级别用于确保按特定顺序获取锁。义务和所有权保证所获得的锁仅被释放一次。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号