|
Title:
|
COMPLEXITY CERTIFICATION OF C++ TEMPLATES |
|
Author(s):
|
Emanuele Covino , Giovanni Pani |
|
ISBN:
|
978-972-8924-62-1 |
|
Editors:
|
Hans Weghorn and Ajith P. Abraham |
|
Year:
|
2008 |
|
Edition:
|
Single |
|
Keywords:
|
Template metaprogramming, polynomial-time computable functions. |
|
Type:
|
Full Paper |
|
First Page:
|
155 |
|
Last Page:
|
163 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
Any partial recursive function can be computed at compile time, using C++ templates to define primitive recursion,
composition, and minimalization.We define a sub-language based on C++ templates, which characterizes the set of
functions computable by a Turing machine with time bounded by a polinomial. This language can be used as a form of
complexity certification of programs. |
|
|
|
|
|
|
