Access the full text.
Sign up today, get DeepDyve free for 14 days.
Hugh Anderson, Siau-Cheng Khoo (2003)
Affine-Based Size-Change Termination
Received October 2006; revised April 2008; accepted June 2008
R. Amadio, Silvano Dal-Zilio (2005)
Resource control for synchronous cooperative threadsTheor. Comput. Sci., 358
J. Marion (2003)
Analysing the implicit complexity of programsInf. Comput., 183
The first criterion is called the quasi-friendly criterion . It is an improvement of a previous criterion suggested in
M. Hofmann (2000)
A Type System for Bounded Space and Functional In-Place UpdateNord. J. Comput., 7
The second criterion
T. Arts, J. Giesl (2000)
Termination of term rewriting using dependency pairsTheor. Comput. Sci., 236
Guillaume Bonfante, J. Marion, Jean-Yves Moyen, Romain Péchoux (2005)
Synthesis of Quasi-interpretations
R. Amadio, Solange Coupet-Grimal, Silvano Dal-Zilio, Line Jakubiec (2004)
A Functional Scenario for Bytecode Verification of Resource Bounds
R. Bird, P. Wadler (1988)
Introduction to functional programming
Guillaume Bonfante, J. Marion, Jean-Yves Moyen (2001)
On Lexicographic Termination Ordering with Space Bound Certifications
G. Huet (1977)
Conflunt reductions: Abstract properties and applications to term rewriting systems18th Annual Symposium on Foundations of Computer Science (sfcs 1977)
the last criterion is called quasi-friendly modulo projection criterion and allows to deal with programs using particular destructive operations or functions
(2009)
ACM Transactions on Computational Logic
J. Avery (2006)
Size-Change Termination and Bound Analysis
N. Jones (1997)
Computability and complexity - from a programming perspective
J. Marion, Jean-Yves Moyen (2000)
Efficient First Order Functional Program Interpreter with Time Bound Certifications
René Thiemann, J. Giesl (2005)
The size-change principle and dependency pairs for termination of term rewritingApplicable Algebra in Engineering, Communication and Computing, 16
M. Hofmann (1999)
Linear types and non-size-increasing polynomial time computationProceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)
echoux consist in subterm functions. Consequently, one challenging open question is to synthesize non-subterm sup-interpretations for sublinear functions
R. Amadio (2003)
Max-Plus Quasi-interpretations
W. Savitch (1970)
Relationships Between Nondeterministic and Deterministic Tape ComplexitiesJ. Comput. Syst. Sci., 4
Chin Lee, N. Jones, Amir Ben-Amram (2001)
The size-change principle for program termination
David Aspinall, Adriana Compagnoni (2004)
Heap-Bounded Assembly LanguageJournal of Automated Reasoning, 31
M. Blum (1967)
A Machine-Independent Theory of the Complexity of Recursive FunctionsJ. ACM, 14
J. Marion, Romain Péchoux (2006)
Resource Analysis by Sup-interpretation
Karl-Heinz Niggl, Henning Wunderlich (2006)
Certifying Polynomial Time and Linear/Polynomial Space for Imperative ProgramsSIAM J. Comput., 35
L. Kristiansen, N. Jones (2005)
The Flow of Data and the Complexity of Algorithms
Guillaume Bonfante, J. Marion, Jean-Yves Moyen (2011)
Quasi-interpretations a way to control resourcesTheor. Comput. Sci., 412
G. Huet (1980)
Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM (JACM), 27
A. Chandra, Dexter Kozen, L. Stockmeyer (1981)
AlternationJ. ACM, 28
The sup-interpretation method is proposed as a new tool to control memory resources of first order functional programs with pattern matching by static analysis. It has been introduced in order to increase the intensionality, that is the number of captured algorithms, of a previous method, the quasi-interpretations. Basically, a sup-interpretation provides an upper bound on the size of function outputs. A criterion, which can be applied to terminating as well as nonterminating programs, is developed in order to bound the stack frame size polynomially. Since this work is related to quasi-interpretation, dependency pairs, and size-change principle methods, we compare these notions obtaining several results. The first result is that, given any program, we have heuristics for finding a sup-interpretation when we consider polynomials of bounded degree. Another result consists in the characterizations of the sets of functions computable in polynomial time and in polynomial space. A last result consists in applications of sup-interpretations to the dependency pair and the size-change principle methods.
ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery
Published: Aug 1, 2009
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.