Publications 2010

Contributions to Books / Journals

Proceedings Article (Full Paper)

• Avanzini, Martin; Moser, Georg (2010): Closing the Gap Between Runtime Complexity and Polytime Computability.
  In: Lynch, Chris (ed.): Proceedings of the 21st International Conference on Rewriting Techniques and Applications. RTA’10, July 11–13, 2010, Edinburgh, UK. Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (= Leibniz International Proceedings in Informatics (LIPICS), 6)., ISBN 978-3-939897-18-7, pp. 33 - 48. (DOI)
  
  
• Avanzini, Martin; Moser, Georg (2010): Complexity Analysis by Graph Rewriting.
  In: Blume, Matthias; Kobayashi, Naoki; Vidal, German (Eds.): Functional and Logic Programming. 10th International Symposium, FLOPS 2010, Sendai, Japan, April 19-21, 2010, Proceedings. Dordrecht - Heidelberg - London - New York - Berlin: Springer (= Lecture Notes in Computer Science, 6009)., ISBN 978-3-642-12250-7, pp. 257 - 271. (DOI)
  
  
• Bonfante, Guillaume; Moser, Georg (2010): Characterising Space Complexity Classes via Knuth-Bendix Orders.
  In: Fermüller, Chris; Voronkov, Andrei (eds.): Logic for Programming, Artificial Intelligence, and Reasoning. 17th International Conference, LPAR-17, Yogyakarta, Indonesia, October 10-15, 2010. Proceedings. Dordrecht - Heidelberg - London - New York - Berlin: Springer (= Lecture Notes in Computer Science, 6397)., ISBN 978-3-642-16241-1, pp. 142 - 156. (DOI)
  
  

Proceedings Article (Abstract)

• Schnabl, Andreas; Moser, Georg (2010): Dependency Graphs, Relative Rule Removal, the Subterm Criterion and Derivational Complexity.
  In: Schneider-Kamp, Peter (ed.): Proceedings of the 11th International Workshop on Termination (WST 2010). Edinburgh, July 14-15, 2010. Edinburgh: University of Edinburgh. (Web link)
  
  

(Book) Reviews

Journal Article (Book Review)

• Moser, Georg (2010): Vágvölgyi, Sándor(H-SZEG-FC): Congruences generated by extended ground term rewrite systems. Fund. Inform. 95 (2009), no. 2-3, 381–399.
  In: Mathematical Reviews, MR2572211. (Web link)
  
  

Lectures 2010

Presentations at Conferences, Symposia, etc.

Conference Lecture (Invited Lecture)

• Lecturer(s): Moser, Georg: Complexity Analysis of Programs by Rewriting.
  IFIP Working Group 1.6 (Term Rewriting) - Meeting 2010, Edinburgh, 2010-07-10. (Web link)
  
  

Conference Lecture (Upon Registration)

• Lecturer(s): Avanzini, Martin Co-author(s): Moser, Georg: Closing the Gap Between Runtime Complexity and Polytime Computability.
  21st International Conference on Rewriting Techniques and Applications (RTA 2010), Edinburgh, 2010-07-13. (Web link)
  
  
• Lecturer(s): Avanzini, Martin Co-author(s): Moser, Georg: Complexity Analysis by Graph Rewriting.
  10th International Symposium on Functional and Logic Programming (FLOPS 2010), Sendai, 2010-04-20. (Web link)
  
  
• Lecturer(s): Moser, Georg Co-author(s): Bonfante, Guillaume: Characterising Space Complexity Classes via Knuth-Bendix Orders.
  17th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 17), Yogyakarta, 2010-10-14. (Web link)
  
  
• Lecturer(s): Schnabl, Andreas Co-author(s): Moser, Georg: Dependency Graphs, Relative Rule Removal, the Subterm Criterion and Derivational Complexity.
  11th International Workshop on Termination (WST 2010), Edinburgh, 2010-07-15. (Web link)
  
  

Session Chairperson / Discussant

• Middeldorp, Aart; Moser, Georg: Session Chair.
  17th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 17), Yogyakarta, 2010-10-14. (Web link)
  
  
• Moser, Georg: Session Chair, Session 1.
  21st International Conference on Rewriting Techniques and Applications (RTA 2010), Edinburgh, 2010-07-11. (Web link)
  
  
• Moser, Georg: Session Chair.
  2nd Workshop on Proof Theory and Rewriting 2010, Obergurgl, 2010-03-28. (Web link)
  
  

Lecture at Summer-/Winterschool

• Lecturer(s): Moser, Georg: Complexity Analysis of Term Rewrite Systems.
  5th International School on Rewriting (ISR 2010), Utrecht, 2010-07-07. (Web link)
  
  

Lecture at Project Meeting / Research Cooperation Meeting

• Lecturer(s): Moser, Georg: Towards Complexity Analysis of Programs by Rewriting.
  3rd Austria-Japan Summer Workshop on Term Rewriting (AJSW 2010), Obergurgl, 2010-08-06. (Web link)
  
  
• Lecturer(s): Moser, Georg: Automated Complexity Analysis of Rewriting.
  Concerto - Final Meeting, Turin, 2010-06-10. (Web link)
  
  
• Lecturer(s): Moser, Georg: Primitive Recursion Revisited.
  Workshop Paris - Innsbruck - Tbilisi: Workshop of the PHC Amadeus project "Logic-Based Analysis of Computation" and the CNRS/GNSF project "Structura and computational properties of logics", Paris, 2010-05-20. (Web link)
  
  

Guest Lectures

Guest Lecture

• Lecturer(s): Moser, Georg: Automated Complexity Analysis Based on the Dependency Pair Method.
  Max-Planck-Institut für Informatik, Saarbrücken, 2010-10-26.
  
  

Presentations for the general public

Public Lecture

• Moser, Georg; Schnabl, Andreas; Winkler, Sarah: Das Informatikstudium in Innsbruck.
  BeSt (Berufs- und Studieninformationsmesse), Innsbruck, 2010-10-20 - 2010-10-22. (Web link)
  
  
• Moser, Georg; Winkler, Sarah: Algorithmen vs. Kochrezepte.
  UniCamp 2010, Innsbruck, 2010-08-10.
  
  

Projects, scholarships and other third-party funds 2010

Research Projects

• Moser, Georg: Derivationskomplexitätsanalyse.
  Fonds zur Förderung der wissenschaftlichen Forschung (FWF), Einzelprojekt
  2007-10-01 - 2011-08-31
  
  

Scholarships

• Moser, Georg: Mobititätsförderung für Logikbasierte Analyse von Berechnungen.
  OeAD-GsmbH (Österreichische Austauschdienst) - Austrian Agency for International Cooperation in Education and Research
  2009-01-01 - 2010-12-31
  
  

Academic Activities and Achievements 2010

Awards and Honours

• Moser, Georg: Forschungspreis der Stiftung Südtiroler Sparkasse (2010).
  
  

Supervision of Student Theses

• Moser, Georg: Avanzini, Martin: Verifying Polytime Computability Automatically (2009 - 2013).
  
  
• Moser, Georg: Schnabl, Andreas: Derivational Complexity Analysis Revisited (2009 - 2012).