home > publications > Runtime Complexity Analysis

Publications tagged "Runtime Complexity Analysis"

Automation CPS Certification Complexity Analysis Constraint Systems Cryptography EasyCrypt Expectation Transformers Functional Programming Graph Rewriting Hardness Haskell Higher-Order ICC ICCT Imperative Imperative Programming Interpretations Invariance Layout-Randomization Memoization OCaml Path Orders Predicative Recursion Probabilistic Program Analysis Quantum Runtime Complexity Analysis Security Sized-Types TCT Term Rewriting Termination Types
Show all.. Download:

2016

  • Martin Avanzini, Georg Moser and Michael Schaper. “TcT: Tyrolean Complexity Tool”. Tools and Algorithms for the Construction and Analysis of Systems - 22nd International Conference, TACAS 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2-8, 2016, Proceedings, volume 9636 of Lecture Notes in Computer Science, pages 407–423, (2016). Springer.

2015

2014

2009

  • Martin Avanzini and Georg Moser. “Dependency Pairs and Polynomial Path Orders”. Rewriting Techniques and Applications, 20th International Conference, RTA 2009, Brası́lia, Brazil, June 29 - July 1, 2009, Proceedings, volume 5595 of Lecture Notes in Computer Science, pages 48–62, (2009). Springer.

2008

  • Martin Avanzini and Georg Moser. “Complexity Analysis by Rewriting”. Functional and Logic Programming, 9th International Symposium, FLOPS 2008, Ise, Japan, April 14-16, 2008. Proceedings, volume 4989 of Lecture Notes in Computer Science, pages 130–146, (2008). Springer.