Publications tagged "Runtime Complexity Analysis"
2016
-
M. Avanzini and G. Moser and M. Schaper. “TcT: Tyrolean Complexity Tool”. (Preprint). Proceedings of the 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 9636 of Lecture Notes in Computer Science, pages 407–423, 2016. Springer Verlag Heidelberg. © Springer Verlag Heidelberg.
2015
-
M. Avanzini and U. Dal Lago and G. Moser. “Higher-Order Complexity Analysis: Harnessing First-Order Tools.”. Proceedings of the 6th International Workshop on Developments in Implicit Complexity, 2015.
2014
-
M. Avanzini and B. Felgenhauer. “Type Introduction for Runtime Complexity Analysis”. Proceedings of the 14th Workshop on Termination, 2014.
2009
-
M. Avanzini and G.Moser. “Dependency Pairs and Polynomial Path Orders”. (Preprint). Proceedings of the 20th International Conference on Rewriting Techniques and Applications, volume 5595 of Lecture Notes in Computer Science, pages 48–62, 2009. Springer Verlag Heidelberg. © Springer Verlag Heidelberg.
2008
-
M. Avanzini and G. Moser. “Complexity Analysis by Rewriting”. (Preprint). Proceedings of the 9th International Symposium on Functional and Logic Programming, volume 5989 of Lecture Notes in Computer Science, pages 130–146, 2008. Springer Verlag Heidelberg. © Springer Verlag Heidelberg.