Special Issue on Implicit Computational Complexity (open post-conference publication of the workshops DICE 2016, 2017 and 2018)
摘要截稿:
全文截稿: 2018-10-12
影响因子: 0.747
期刊难度:
CCF分类: B类
中科院JCR分区:
• 大类 : 计算机科学 - 4区
• 小类 : 计算机:理论方法 - 4区
Overview
The area of Implicit Computational Complexity has grown from several proposals for using logic and formal methods to provide languages for complexity-bounded computation (such as polynomial time, polynomial space or logarithmic space computation). Its aim is to study computational complexity without reference to external measuring conditions or particular machine models, but only in terms of language restrictions or logical/computational principles implying complexity properties.
We welcome contributions on various aspects of Implicit Computational
Complexity, including (but not exclusively) the following topics:
- types for controlling / inferring / checking complexity
- logical systems for implicit computational complexity
- programming languages for complexity bounded computation
- logics closely related to complexity classes
- static resource analysis and practical applications
- semantics of complexity-bounded computation
- application of implicit complexity to security
- rewriting and termination orderings
- termination and resource analysis for probabilistic programs