Skip to Main content Skip to Navigation
Journal articles

Quasi-interpretations a way to control resources

Abstract : This paper presents in a reasoned way our works on resource analysis by quasi- interpretations. The controlled resources are typically the runtime, the runspace or the size of a result in a program execution. Quasi-interpretations allow analyzing system complexity. A quasi-interpretation is a numerical assignment, which provides an upper bound on computed func- tions and which is compatible with the program operational semantics. Quasi- interpretation method offers several advantages: (i) It provides hints in order to optimize an execution, (ii) it gives resource certificates, and (iii) finding quasi- interpretations is decidable for a broad class which is relevant for feasible com- putations. By combining the quasi-interpretation method with termination tools (here term orderings), we obtained several characterizations of complexity classes starting from Ptime and Pspace.
Document type :
Journal articles
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-00591862
Contributor : Jean-Yves Marion Connect in order to contact the contributor
Submitted on : Tuesday, May 10, 2011 - 9:55:07 PM
Last modification on : Wednesday, October 27, 2021 - 2:39:59 PM
Long-term archiving on: : Thursday, August 11, 2011 - 2:55:14 AM

File

tcs.pdf
Files produced by the author(s)

Identifiers

Citation

Guillaume Bonfante, Jean-Yves Marion, Jean-Yves Moyen. Quasi-interpretations a way to control resources. Theoretical Computer Science, Elsevier, 2011, 412 (25), pp.2776-2796. ⟨10.1016/j.tcs.2011.02.007⟩. ⟨hal-00591862⟩

Share

Metrics

Les métriques sont temporairement indisponibles