Skip to Main content Skip to Navigation
New interface
Conference papers

Complexity Information Flow in a Multi-threaded Imperative Language

Jean-Yves Marion 1 Romain Péchoux 1 
1 CARTE - Theoretical adverse computations, and safety
Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : We propose a type system to analyze the time consumed by multi-threaded imperative programs with a shared global memory, which delineates a class of safe multi-threaded programs. We demon-strate that a safe multi-threaded program runs in polynomial time if (i) it is strongly terminating wrt a non-deterministic scheduling policy or (ii) it terminates wrt a deterministic and quiet scheduling policy. As a consequence, we also characterize the set of polynomial time functions. The type system presented is based on the fundamental notion of data tiering, which is central in implicit computational complexity. It regu-lates the information flow in a computation. This aspect is interesting in that the type system bears a resemblance to typed based informa-tion flow analysis and notions of non-interference. As far as we know, this is the first characterization by a type system of polynomial time multi-threaded programs.
Document type :
Conference papers
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download
Contributor : Romain Péchoux Connect in order to contact the contributor
Submitted on : Tuesday, November 18, 2014 - 1:58:00 PM
Last modification on : Saturday, June 25, 2022 - 7:41:09 PM
Long-term archiving on: : Friday, April 14, 2017 - 8:15:17 PM


Files produced by the author(s)




Jean-Yves Marion, Romain Péchoux. Complexity Information Flow in a Multi-threaded Imperative Language. TAMC 2014, Apr 2014, Chennai, India. pp.124 - 140, ⟨10.1007/978-3-319-06089-7_9⟩. ⟨hal-01084043⟩



Record views


Files downloads