A type system for complexity flow analysis - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

A type system for complexity flow analysis

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.
Fichier principal
Vignette du fichier
effraie.pdf (352.7 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00591853 , version 1 (10-05-2011)

Identifiers

  • HAL Id : hal-00591853 , version 1

Cite

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⟩
163 View
1928 Download

Share

Gmail Facebook X LinkedIn More