Loops under Strategies … Continued
René Thiemann, Christian Sternagel, Jürgen Giesl, and Peter Schneider-Kamp
Proceedings of the 1st International Workshop on Strategies in Rewriting, Proving, and Programming (IWS 2010), Electronic Proceedings in Theoretical Computer Science 44, pp. 51 – 65, 2010.
Automatic Certification of Termination Proofs
Christian Sternagel
PhD thesis, University of Innsbruck, 2010.
Termination Analysis by Tree Automata Completion
Martin Korp
PhD thesis, University of Innsbruck, 2010.
Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting
Friedrich Neurauter, Harald Zankl, and Aart Middeldorp
Proceedings of the 17th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR-17), Lecture Notes in Computer Science (Advanced Research in Computing and Software Science) 6397, pp. 550 – 564, 2010.
Characterising Space Complexity Classes via Knuth-Bendix Orders
Guillaume Bonfante and Georg Moser
Proceedings of the 17th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR-17), Lecture Notes in Computer Science (Advanced Research in Computing and Software Science) 6397, pp. 142 – 156, 2010.
Signature Extensions Preserve Termination – An Alternative Proof via Dependency Pairs
Christian Sternagel and René Thiemann
Proceedings of the 19th Annual Conference of the European Association for Computer Science Logic (CSL 2010), Lecture Notes in Computer Science 6247, pp. 514 – 528, 2010.
Executable Multivariate Polynomials
Christian Sternagel and René Thiemann
The Archive of Formal Proofs, 2010.
POP* and Semantic Labeling using SAT
Martin Avanzini
Interfaces: Explorations in Logic, Language and Computation, Lecture Notes in Artificial Intelligence 6211, pp. 155 – 166, 2010.
Cdiprover3: A Tool for Proving Derivational Complexities of Term Rewriting Systems
Andreas Schnabl
Interfaces: Explorations in Logic, Language and Computation, Lecture Notes in Artificial Intelligence 6211, pp. 142 – 154, 2010.
Termination Tools in Ordered Completion
Sarah Winkler and Aart Middeldorp
Proceedings of the 5th International Joint Conference on Automated Reasoning (IJCAR 2010), Lecture Notes in Artificial Intelligence 6173, pp. 518 – 532, 2010.
Monotonicity Criteria for Polynomial Interpretations over the Naturals
Friedrich Neurauter, Harald Zankl, and Aart Middeldorp
Proceedings of the 5th International Joint Conference on Automated Reasoning (IJCAR 2010), Lecture Notes in Artificial Intelligence 6173, pp. 502 – 517, 2010.
Decreasing Diagrams and Relative Termination
Nao Hirokawa and Aart Middeldorp
Proceedings of the 5th International Joint Conference on Automated Reasoning (IJCAR 2010), Lecture Notes in Artificial Intelligence 6173, pp. 487 – 501, 2010.
Executable Matrix Operations on Matrices of Arbitrary Dimensions
Christian Sternagel and René Thiemann
The Archive of Formal Proofs, 2010.
Abstract Rewriting
Christian Sternagel and René Thiemann
The Archive of Formal Proofs, 2010.
Optimizing mkbTT (System Description)
Sarah Winkler, Haruhiko Sato, Aart Middeldorp, and Masahito Kurihara
Proceedings of the 21st International Conference on Rewriting Techniques and Applications (RTA 2010), Leibniz International Proceedings in Informatics 6, pp. 373 – 384, 2010.
Modular Complexity Analysis via Relative Complexity
Harald Zankl and Martin Korp
Proceedings of the 21st International Conference on Rewriting Techniques and Applications (RTA 2010), Leibniz International Proceedings in Informatics 6, pp. 385 – 400, 2010.
Certified Subterm Criterion and Certified Usable Rules
Christian Sternagel and René Thiemann
Proceedings of the 21st International Conference on Rewriting Techniques and Applications (RTA 2010), Leibniz International Proceedings in Informatics 6, pp. 325 – 340, 2010.
Polynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over the Integers
Friedrich Neurauter and Aart Middeldorp
Proceedings of the 21st International Conference on Rewriting Techniques and Applications (RTA 2010), Leibniz International Proceedings in Informatics 6, pp. 243 – 258, 2010.
Closing the Gap Between Runtime Complexity and Polytime Complexity
Martin Avanzini and Georg Moser
Proceedings of the 21st International Conference on Rewriting Techniques and Applications (RTA 2010), Leibniz International Proceedings in Informatics 6, pp. 33 – 48, 2010.
Satisfiability of Non-Linear (Ir)rational Arithmetic
Harald Zankl and Aart Middeldorp
Proceedings of the 16th International Conference on Logic for Programming and Automated Reasoning (LPAR-16), Lecture Notes in Artificial Intelligence 6355, pp. 481 – 500, 2010.
Complexity Analysis by Graph Rewriting
Martin Avanzini and Georg Moser
Proceedings of the 10th International Symposium on Functional and Logic Programming (FLOPS 2010), Lecture Notes in Computer Science 6009, pp. 257 – 271, 2010.
Finding and Certifying Loops
Harald Zankl, Christian Sternagel, Dieter Hofbauer, and Aart Middeldorp
Proceedings of the 36th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2010), Lecture Notes in Computer Science 5901, pp. 755 – 766, 2010.