Implementation and Complexity of the Lowest Static Reduction - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport Année : 2003

Implementation and Complexity of the Lowest Static Reduction

Bernard Paul Serpette
  • Fonction : Auteur
Szabolcs Szentes
  • Fonction : Auteur

Résumé

The lowest static reduction (LSR) is the 0^th-order Control-Flow Analysis without continuation passing style (CPS) consideration. This article presents some algorithms resolving LSR and their related complexities. Even if this analysis is generally declared to be computable in cubic time, a stand alone algorithm reaching this complexity is not so straightforward. With the -calculus as input language, we will start with a blind algorithm and step by step we will finally exhibit the algorithm which run, for worst cases, in cubic time related to the size of the program.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
RR-5034.pdf (263.5 Ko) Télécharger le fichier
Loading...

Dates et versions

inria-00071550 , version 1 (23-05-2006)

Identifiants

  • HAL Id : inria-00071550 , version 1

Citer

Ludovic Henrio, Bernard Paul Serpette, Szabolcs Szentes. Implementation and Complexity of the Lowest Static Reduction. RR-5034, INRIA. 2003. ⟨inria-00071550⟩
147 Consultations
94 Téléchargements

Partager

Gmail Facebook X LinkedIn More