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

线性递归程序中的死锁检测

Deadlock detection in linear recursive programs

Elena Giachino, Cosimo Laneve

摘要:

在允许动态资源创建的递归程序中进行死锁检测是非常复杂的,解决方案要么给出不精确的答案,要么不具有可扩展性。我们定义了一个基本模型的“线性递归程序”的死锁检测算法。支撑该算法的理论是将名称排列理论推广到所谓的“突变”,通过引入重复和新鲜名称来转换元组。我们的算法实现了面向对象程序设计语言的死锁分析器的后端,一旦关联程序/基本模型程序已被定义为前端。

英文摘要:

Deadlock detection in recursive programs that admit dynamic resource creation is extremely complex and solutions either give imprecise answers or do not scale. We define an algorithm for detecting deadlocks of "linear recursive programs" of a basic model. The theory that underpins the algorithm is a generalization of the theory of permutations of names to so-called "mutations", which transform tuples by introducing duplicates and fresh names. Our algorithm realizes the back-end of deadlock analyzers for object-oriented programming languages, once the association programs/basic-model-programs has been defined as front-end.

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

↑