home > publications > TCT

Publications tagged "TCT"

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 and Georg Moser. “A Combination Framework for Complexity”. Inf. Comput. 248: 22–55 (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

  • Martin Avanzini, Christian Sternagel and René Thiemann. “Certification of Complexity Proofs using CeTA”. 26th International Conference on Rewriting Techniques and Applications, RTA 2015, June 29 to July 1, 2015, Warsaw, Poland, volume 36 of LIPIcs, pages 23–39, (2015). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

2013

  • Martin Avanzini and Georg Moser. “A Combination Framework for Complexity”. 24th International Conference on Rewriting Techniques and Applications, RTA 2013, June 24-26, 2013, Eindhoven, The Netherlands, volume 21 of LIPIcs, pages 55–70, (2013). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. © cc.

  • Martin Avanzini and Georg Moser. “Tyrolean Complexity Tool: Features and Usage”. 24th International Conference on Rewriting Techniques and Applications, RTA 2013, June 24-26, 2013, Eindhoven, The Netherlands, volume 21 of LIPIcs, pages 71–80, (2013). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

  • M. Avanzini. “Verifying Polytime Computability Automatically”. PhD thesis, University of Innsbruck, 2013.

2012

2009

  • Martin Avanzini. “POP* and Semantic Labeling Using SAT”. (Preprint). Interfaces: Explorations in Logic, Language and Computation, ESSLLI 2008 and ESSLLI 2009 Student Sessions. Selected Papers, volume 6211 of Lecture Notes in Computer Science, pages 155–166, (2009). Springer.