arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1201.0345cs.LOcs.CCcs.PL
收藏

隐式计算复杂性发展第二次研讨会论文集

Proceedings Second Workshop on Developments in Implicit Computational Complexity

Jean-Yves Marion

摘要:

本卷包含了第二届国际研讨会的会议记录在隐式计算复杂性的发展(DICE 2011),这发生在4月2日至3日2011年在萨尔布吕肯,德国,作为一个卫星事件的联合欧洲会议的理论和实践的软件,ETAPS 2011。隐式计算复杂性研究的目的是在不涉及外部测量条件或特定机器模型的情况下,而是通过考虑对程序设计语言的限制或隐含复杂性属性的逻辑原则来研究计算复杂性。本次研讨会的目的是汇集研究隐式计算复杂性的研究人员,从其逻辑和语义方面到与程序的静态分析相关的方面,以促进他们的互动,并为新来者提供该领域当前趋势的概述。第一次DICE研讨会于2010年在ETAPS举行,并发表在EPTCS第23卷(eptcs.org/content.cgi? DICE 2010)。

英文摘要:

This volume contains the proceedings of the Second International Workshop on Developments in Implicit Computational complExity (DICE 2011), which took place on April 2-3 2011 in Saarbruecken, Germany, as a satellite event of the Joint European Conference on Theory and Practice of Software, ETAPS 2011. Implicit Computational Complexity aims at studying computational complexity without referring to external measuring conditions or particular machine models, but instead by considering restrictions on programming languages or logical principles implying complexity properties. The aim of this workshop was to bring together researchers working on implicit computational complexity, from its logical and semantics aspects to those related to the static analysis of programs, so as to foster their interaction and to give newcomers an overview of the current trends in this area. The first DICE workshop was held in 2010 at ETAPS and published in EPTCS, volume 23 (http://eptcs.org/content.cgi?DICE2010).

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

↑