Skip to Main content Skip to Navigation
Conference papers

A type system for complexity flow analysis

Jean-Yves Marion 1
1 CARTE - Theoretical adverse computations, and safety
LORIA - FM - Department of Formal Methods , Inria Nancy - Grand Est
Abstract : We propose a type system for an imperative programming language, which certifies program time bounds. This type system is based on secure flow information analysis. Each program variable has a level and we prevent information from flowing from low level to higher level variables. We also introduce a downgrading mechanism in order to delineate a broader class of programs. Thus, we propose a relation between security-typed language and implicit computational complexity. We establish a characterization of the class of polynomial time functions.
Document type :
Conference papers
Complete list of metadata
Contributor : Jean-Yves Marion Connect in order to contact the contributor
Submitted on : Tuesday, May 10, 2011 - 1:31:30 PM
Last modification on : Saturday, October 16, 2021 - 11:26:05 AM
Long-term archiving on: : Sunday, December 4, 2016 - 12:25:06 AM


Files produced by the author(s)


  • HAL Id : hal-00591853, version 1



Jean-Yves Marion. A type system for complexity flow analysis. Twenty-Sixth Annual IEEE Symposium on Logic in Computer Science - LICS 2011, Jun 2011, Toronto, Canada. ⟨hal-00591853⟩



Record views


Files downloads