This paper presents in a reasoned way our works on resource analysis by quasiinterpretations. 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 functions and which is compatible with the program operational semantics. Quasiinterpretation method offers several advantages: (i) It provides hints in order to optimize an execution, (ii) it gives resource certificates, and (iii) finding quasiinterpretations is decidable for a broad class which is relevant for feasible computations. By combining the quasi-interpretation method with termination tools (here term orderings), we obtained several characterizations of complexity classes starting from Ptime and Pspace. →v, we have u ≥ v PROOF. A context is a particular term that we write C[⋄] where ⋄ is a new variable. The substitution of ⋄ in C[⋄] by a term t is noted C[t].
In the series of works on polynomial quasi-interpretations REF one studies polynomial upper bounds.
Quasi-interpretations a way to control resources
Theor. Comput. Sci.
Theor. Comput. Sci.
Mathematics Computer Science