Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Contejean, Evelyne
Marché, Claude
Tomás, Ana Paula
and
Urbain, Xavier
2005.
Mechanically Proving Termination Using Polynomial Interpretations.
Journal of Automated Reasoning,
Vol. 34,
Issue. 4,
p.
325.
Bonfante, Guillaume
Marion, Jean-Yves
and
Moyen, Jean-Yves
2005.
Term Rewriting and Applications.
Vol. 3467,
Issue. ,
p.
150.
Marion, Jean-Yves
and
Péchoux, Romain
2006.
Functional and Logic Programming.
Vol. 3945,
Issue. ,
p.
163.
Lucas, Salvador
2006.
On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting.
Applicable Algebra in Engineering, Communication and Computing,
Vol. 17,
Issue. 1,
p.
49.
Niggl, Karl-Heinz
and
Wunderlich, Henning
2006.
Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs.
SIAM Journal on Computing,
Vol. 35,
Issue. 5,
p.
1122.
Avanzini, Martin
Moser, Georg
and
Schnabl, Andreas
2008.
Automated Reasoning.
Vol. 5195,
Issue. ,
p.
132.
Avanzini, Martin
and
Moser, Georg
2008.
Functional and Logic Programming.
Vol. 4989,
Issue. ,
p.
130.
Hirokawa, Nao
and
Moser, Georg
2008.
Automated Reasoning.
Vol. 5195,
Issue. ,
p.
364.
Moser, Georg
and
Schnabl, Andreas
2008.
Rewriting Techniques and Applications.
Vol. 5117,
Issue. ,
p.
276.
Bonfante, Guillaume
and
Guiraud, Yves
2008.
Intensional Properties of Polygraphs.
Electronic Notes in Theoretical Computer Science,
Vol. 203,
Issue. 1,
p.
65.
Marion, Jean-Yves
and
Péchoux, Romain
2008.
Characterizations of polynomial complexity classes with a better intensionality.
p.
79.
Schnabl, Andreas
2010.
Interfaces: Explorations in Logic, Language and Computation.
Vol. 6211,
Issue. ,
p.
142.
Bonfante, Guillaume
2010.
Observation of implicit complexity by non confluence.
Electronic Proceedings in Theoretical Computer Science,
Vol. 23,
Issue. ,
p.
15.
Bonfante, Guillaume
and
Deloup, Florian
2010.
Theory and Applications of Models of Computation.
Vol. 6108,
Issue. ,
p.
139.
Noschinski, Lars
Emmes, Fabian
and
Giesl, Jürgen
2011.
Automated Deduction – CADE-23.
Vol. 6803,
Issue. ,
p.
422.
Dal Lago, Ugo
2012.
Lectures on Logic and Computation.
Vol. 7388,
Issue. ,
p.
89.
BAILLOT, PATRICK
DAL LAGO, UGO
and
MOYEN, JEAN-YVES
2012.
On quasi-interpretations, blind abstractions and implicit complexity.
Mathematical Structures in Computer Science,
Vol. 22,
Issue. 4,
p.
549.
Noschinski, Lars
Emmes, Fabian
and
Giesl, Jürgen
2013.
Analyzing Innermost Runtime Complexity of Term Rewriting by Dependency Pairs.
Journal of Automated Reasoning,
Vol. 51,
Issue. 1,
p.
27.
Péchoux, Romain
2013.
Synthesis of sup-interpretations: A survey.
Theoretical Computer Science,
Vol. 467,
Issue. ,
p.
30.
Schmitz, Sylvain
2014.
Reachability Problems.
Vol. 8762,
Issue. ,
p.
1.
Discussions
No Discussions have been published for this article.