arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2309.07307cs.LOcs.PL
收藏

将 Pi-Calculus 名字用作锁

Using Pi-Calculus Names as Locks

Daniel Hirschkoff, Enguerrand Prebet

AI总结:

本文引入类型系统将异步pi-calculus名字用作锁,支持锁释放,保证无死锁和无泄漏,并研究类型化行为等价。

摘要:

锁是并发编程中的经典数据结构。我们引入了一种类型系统,以确保异步 pi-calculus 的名字被用作锁。我们的演算还包含一个构造,用于在确知锁永不再被获取时释放该锁。可类型化保证两个性质:无死锁,即对锁的获取操作不会永远等待;以及无泄漏,即所有锁最终都会被释放。我们利用类型规则的简洁性来研究所导出的类型化行为等价。在定义了 barb 等价之后,我们引入了一种可靠的标签互模拟,使得能够证明操作和释放锁的程序之间的等价性。

英文摘要:

Locks are a classic data structure for concurrent programming. We introduce a type system to ensure that names of the asynchronous pi-calculus are used as locks. Our calculus also features a construct to deallocate a lock once we know that it will never be acquired again. Typability guarantees two properties: deadlock-freedom, that is, no acquire operation on a lock waits forever; and leak-freedom, that is, all locks are eventually deallocated. We leverage the simplicity of our typing discipline to study the induced typed behavioural equivalence. After defining barbed equivalence, we introduce a sound labelled bisimulation, which makes it possible to establish equivalence between programs that manipulate and deallocate locks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑