Type-Based Complexity Analysis for Fork Processes

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.

[1]  K. J. Bma.  Integrity considerations for secure computer systems , 1977 .

[2]  Jean-Yves Marion,et al.  A Type System for Complexity Flow Analysis , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

[3]  J. Robin B. Cockett,et al.  A Categorical Setting for Lower Complexity , 2010, MFPS.

[4]  Samuel R. Buss,et al.  The Boolean formula value problem is in ALOGTIME , 1987, STOC.

[5]  Geoffrey Smith,et al.  A Sound Type System for Secure Flow Analysis , 1996, J. Comput. Secur..

[6]  Antoine Madet.  A polynomial time {\lambda}-calculus with multithreading and side effects , 2012 .

[7]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[8]  Geoffrey Smith,et al.  Secure information flow in a multi-threaded imperative language , 1998, POPL '98.

[9]  Roberto Amadio,et al.  Feasible reactivity in a synchronous pi-calculus , 2007 .

[10]  Yves Lafont,et al.  Soft linear logic and polynomial time , 2004, Theor. Comput. Sci..

[11]  Roberto M. Amadio,et al.  Feasible Reactivity for Synchronous Cooperative Threads , 2006, EXPRESS.

[12]  Marco Gaboardi,et al.  A logical account of pspace , 2008, POPL '08.

[13]  Ugo Dal Lago,et al.  Soft Session Types , 2011, EXPRESS.

[14]  Roberto M. Amadio,et al.  Feasible reactivity in a synchronous Π-calculus , 2007, PPDP '07.

[15]  Daniel Leivant,et al.  Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space , 1994, CSL.

[16]  Henning Wunderlich,et al.  Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs , 2006, SIAM J. Comput..

[17]  Neil D. Jones.  The expressive power of higher-order types or, life without CONS , 2001, J. Funct. Program..

[18]  Antoine Madet.  A polynomial time λ-calculus with multithreading and side effects , 2012, PPDP.

[19]  Andrew C. Myers,et al.  Language-based information-flow security , 2003, IEEE J. Sel. Areas Commun..

[20]  Daniel Leivant,et al.  Predicative Functional Recurrence and Poly-space , 1997, TAPSOFT.

[21]  Neil D. Jones,et al.  A flow calculus of mwp-bounds for complexity analysis , 2009, TOCL.

[22]  Sanjeev Saxena,et al.  On Parallel Prefix Computation , 1994, Parallel Process. Lett..

[23]  Jean-Yves Moyen,et al.  Resource control graphs , 2009, TOCL.

[24]  Donald Sanella.  What Does the Future Hold for Theoretical Computer Science , 1997 .

[25]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.