Annual Report 2010 - Fachgruppe Informatik an der RWTH Aachen ...

Publications:
Journals and Conferences
P. Schneider-Kamp, J. Giesl, and M. T. Nguyen. The Dependency Triple Framework for
Termination of Logic Programs. In Proceedings of the 19th International Symposium on
Logic-Based Program Synthesis and Transformation (LOPSTR '09), Coimbra, Portugal,
Lecture Notes in Computer Science 6037, pages 37-51, Springer-Verlag, 2010.
J. Giesl. Current Trends in Automated Deduction. KI - Künstliche Intelligenz, 24(1):11-13,
Springer-Verlag, 2010.
J. Giesl (ed.). Special Issue on Automated Deduction. KI - Künstliche Intelligenz, 24(1):11-
13, Springer-Verlag, 2010.
C. Fuhs and P. Schneider-Kamp. Synthesizing Shortest Straight-Line Programs over GF(2)
using SAT. In Proceedings of the 13th International Conference on Theory and Applications
of Satisfiability Testing (SAT '10), Edinburgh, UK, Lecture Notes in Computer Science 6175,
pages 71-84, Springer-Verlag, 2010.
P. Schneider-Kamp, J. Giesl, T. Ströder, A. Serebrenik, and R. Thiemann. Automated
Termination Analysis for Logic Programs with Cut. In Proceedings of the 26th International
Conference on Logic Programming (ICLP '10), Edinburgh, UK, Theory and Practice of Logic
Programming, 10(4-6):365-381, Cambridge University Press, 2010.
C. Otto, M. Brockschmidt, C. von Essen, and J. Giesl. Automated Termination Analysis of
Java Bytecode by Term Rewriting. In Proceedings of the 21th International Conference on
Rewriting Techniques and Applications (RTA '10), Edinburgh, UK, LIPIcs Leibniz
International Proceedings in Informatics 6, pages 259-276, Dagstuhl Publishing, 2010.
J. Giesl and R. Hähnle (eds.). Proceedings of the 5 th International Joint Conference on Automated
Reasoning (IJCAR '10), Edinburgh, UK, Lecture Notes in Artificial Intelligence 6173,
534 pages, Springer-Verlag, 2010.
M. Codish, C. Fuhs, J. Giesl, and P. Schneider-Kamp. Lazy Abstraction for Size-Change
Termination. In Proceedings of the 17th International Conference on Logic for
Programming, Artificial Intelligence, and Reasoning (LPAR '10), Yogyakarta, Indonesia,
Lecture Notes in Computer Science (ARCoSS) 6397, pages 217-232, Springer-Verlag, 2010.
T. Ströder, P. Schneider-Kamp, and J. Giesl. Dependency Triples for Improving Termination
Analysis of Logic Programs with Cut. In Proceedings of the 20 th International Symposium on
Logic-Based Program Synthesis and Transformation (LOPSTR '10), Hagenberg, Austria,
Lecture Notes in Computer Science, Springer-Verlag. To appear.
M. Brockschmidt, C. Otto, C. von Essen, and J. Giesl. Termination Graphs for Java Bytecode.
In Verification, Induction, Termination Analysis, Lecture Notes in Computer Science,
Springer-Verlag. To appear.
M. T. Nguyen, D. De Schreye, J. Giesl, and P. Schneider-Kamp. Polytool: Polynomial Interpretations
as a Basis for Termination Analysis of Logic Programs. Theory and Practice of
Logic Programming, Cambridge University Press. To appear.
C. Fuhs, J. Giesl, M. Parting, P. Schneider-Kamp, and S. Swiderski. Proving Termination by
Dependency Pairs and Inductive Theorem Proving. Journal of Automated Reasoning,
Springer-Verlag. To appear.
115