The Boolean formula value problem is in ALOGTIME
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Secure information flow in a multi-threaded imperative language
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Journal of the ACM (JACM)
Journal of the ACM (JACM)
A sound type system for secure flow analysis
Journal of Computer Security
Predicative Functional Recurrence and Poly-space
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
The expressive power of higher-order types or, life without CONS
Journal of Functional Programming
Soft linear logic and polynomial time
Theoretical Computer Science - Implicit computational complexity
Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs
SIAM Journal on Computing
Feasible reactivity in a synchronous Π-calculus
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A flow calculus of mwp-bounds for complexity analysis
ACM Transactions on Computational Logic (TOCL)
ACM Transactions on Computational Logic (TOCL)
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
A Categorical Setting for Lower Complexity
Electronic Notes in Theoretical Computer Science (ENTCS)
A Type System for Complexity Flow Analysis
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
Language-based information-flow security
IEEE Journal on Selected Areas in Communications
A polynomial time λ-calculus with multithreading and side effects
Proceedings of the 14th symposium on Principles and practice of declarative programming
| Hi-index | 0.00 |
We introduce a type system for concurrent programs described as a parallel imperative language using while-loops and fork/wait instructions, in which processes do not share a global memory, in order to analyze computational complexity. The type system provides an analysis of the data-flow based both on a data ramification principle related to tiering discipline and on secure typed languages. The main result states that well-typed processes characterize exactly the set of functions computable in polynomial space under termination, confluence and lock-freedom assumptions. More precisely, each process computes in polynomial time so that the evaluation of a process may be performed in polynomial time on a parallel model of computation. Type inference of the presented analysis is decidable in linear time provided that basic operator semantics is known.