Skip to Main content Skip to Navigation
Reports

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 demonstrate 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 regulates the information flow in a computation. This aspect is interesting in that the type system bears a resemblance to typed based information 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.
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/hal-00684026
Contributor : Romain Péchoux <>
Submitted on : Friday, March 30, 2012 - 1:59:44 PM
Last modification on : Tuesday, December 18, 2018 - 4:48:02 PM
Document(s) archivé(s) le : Wednesday, December 14, 2016 - 6:59:04 PM

Files

hulotte.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00684026, version 1
  • ARXIV : 1203.6878

Collections

Citation

Jean-Yves Marion, Romain Péchoux. Complexity Information Flow in a Multi-threaded Imperative Language. [Research Report] 2012, pp.16. ⟨hal-00684026⟩

Share

Metrics

Record views

446

Files downloads

323