DICE 2013 - 4th International workshop on Developments in Implicit Computational complExity (DICE)
Topics/Call fo Papers
The area of Implicit Computational Complexity (ICC) grew out from several proposals to use logic and formal methods to provide languages for complexity-bounded computation (e.g., polytime or logspace computation). It aims at studying the computational complexity of programs without referring to external measuring conditions or a particular machine model, but only by considering language restrictions or logical / computational principles entailing complexity properties. Several approaches have been explored for that purpose, like restrictions on primitive recursion and ramification, rewriting systems, linear logic, types and lambda calculus, interpretations of functional and imperative programs. The workshop is intended to be a forum for researchers interested in ICC to present new results and discuss recent developments in this area.
Simona Ronchi della Rocca (Univ. of Torino, Italy)
Simona Ronchi della Rocca (Univ. of Torino, Italy)
Other CFPs
- 8th Workshop on Bytecode Semantics, Verification, Analysis and Transformation (Bytecode)
- 2nd International Workshop on Bidirectional Transformations (BX)
- 8th Workshop on Applied and Computational Category Theory (ACCAT)
- 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)
- 2nd Conference on Principles of Security and Trust (POST 2013)
Last modified: 2012-06-30 21:25:27